摘要
基于偏序集及多维体理论，文中提出了Ｌ－集概念，并将布尔函数极小化问题抽象为Ｌ－集的极大内多维体。还设计了一个基于Ｌ－集的图搜索的快速布尔函数极小化算法，使可解输入变量数达到２６个。
This paper presents a new way which uses graphic method to find a near-minimal cover for a single output Boolean function A Boolean function can be described as a L—graph Each maximum INNERUBE of L—graph is equivalent to a prime implication The minimization is changed into finding the maximum INNERCUBES An Optimal algorithm is given too
出处
《计算机工程与设计》
CSCD
北大核心
1997年第5期60-63,共4页
Computer Engineering and Design
关键词
布尔函数
算法
质蕴涵项
极小化
Boolean functions Optimization Algorithms Prime implication
