关于实质本源蕴涵项的识别问题  

ON THE IDENTIFICATION OF ESSENTIAL PRIME IMPLICANTS

作　　者：王波[1] 

机构地区：[1]南通纺织工学院自动化系

出　　处：《计算机研究与发展》1995年第12期40-44,61,共6页Journal of Computer Research and Development

摘　　要：本文揭示了ＥＳＰＲＥＳＳＯ算法和Ｍｕｒｏｇａ等提出的求绝对最小化算法中识别实质本源蕴涵项的方法具有近似的复杂度。文中还给出了一个在产生本源蕴涵项过程中识别实质本源项的算法。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.

关 键 词：余因子 实质本源蕴涵项 识别 逻辑函数 

分 类 号：O153.2[理学—数学]