摘要
逻辑函数的绝对最小化算法存在的主要问题是运行时间过长和需要的存储空间过大．本文提出了一个从给定本源蕴涵项集合中抽出一个绝对最小覆盖的算法，而时间、空间的需求被大大地缩小了．
In absolute minimization procedures for logic functions,the excessively long processing time and excessively large memory space requirement are major problems to overcome. This paper presents a new method to extract an absolute minimal cover from a given set of prime implicants with greatly reduced time and space requirement.
出处
《计算机辅助设计与图形学学报》
EI
CSCD
北大核心
1999年第2期143-146,共4页
Journal of Computer-Aided Design & Computer Graphics
关键词
包含函数
逻辑函数
最小覆盖
算法
inclusion function, presence factor, unate variable, ratio set
