A Simplified Method for Generating Essential Complementary Partitions

Wu Xin-yu

您当前的位置：

首页 >

文章列表页 >

A Simplified Method for Generating Essential Complementary Partitions

更新时间：2025-12-08

- A Simplified Method for Generating Essential Complementary Partitions
- Acta Electronica Sinica Issue 2, Pages: 109-111(1985)
- 作者机构：
  
  南京邮电学院
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：1985
- 稿件说明：
移动端阅览
[1]吴新余.基本互补划分的简易产生法[J].电子学报,1985(02):109-111.

Wu Xin-yu. A Simplified Method for Generating Essential Complementary Partitions[J]. Acta Electronica Sinica, 1985, (2): 109-111.
[1]吴新余.基本互补划分的简易产生法[J].电子学报,1985(02):109-111. DOI：

Wu Xin-yu. A Simplified Method for Generating Essential Complementary Partitions[J]. Acta Electronica Sinica, 1985, (2): 109-111. DOI：

摘要

本文给出了改进的基本互补划分的定义

研究了非基本互补划分的规律

提出了产生基本互补划分表的简易规则及覆盖有向树群矩阵算法。文中以实例说明了此法的有效性与快速性

这一方法可以逻辑地推广到K为更大值的情况。

Abstract

The improved essential complementary partitions is defined and the rules for non-essential complementary partitions are illustrated by means Of the covering di-tree groups. Some simplified rules and the di-tree groups matrix algorithm for ECP generation are proposed. An example is given to show the effectiveness and fast speed of this method which can be easily extended to cases with larger K values.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

No data

Related Author

No data

Related Institution

No data

⁰