| 关于实质本源蕴涵项的识别问题 |
| |
| 引用本文： | 王波. 关于实质本源蕴涵项的识别问题[J]. 计算机研究与发展, 1995, 32(12): 40-44,61 |
| |
| 作者姓名： | 王波 |
| |
| 作者单位： | 南通纺织工学院自动化系 |
| |
| 摘 要： | 本文揭示ＥＳＰＲＥＳＳＯ算法和Ｍｕｒｏｇａ等提出的求绝对最小算法中识别实质本源蕴涵项的方法具有近似的复杂度。文中还给出了一个在产生本源蕴涵项过程中识别实质本源项的算法。
|
| 关 键 词： | 余因子 实质本源蕴涵项 识别 逻辑函数 |
ON THE IDENTIFICATION OF ESSENTIAL PRIME IMPLICANTS |
| |
| Wang Bo. ON THE IDENTIFICATION OF ESSENTIAL PRIME IMPLICANTS[J]. Journal of Computer Research and Development, 1995, 32(12): 40-44,61 |
| |
| Authors: | Wang Bo |
| |
| Abstract: | This paper reveals that the methods to identify essential prime implicants of both ESPRESSO and that proposed by S. Hong, R. Cutier and S. Muroga have the same computational complexity. A method to identify essential primes while generating prime implicants is also given. |
| |
| Keywords: | Cofactor ratio set minimal cover essential prime implicant. |
| 本文献已被 CNKI 维普 等数据库收录！ |
