逻辑函数绝对最小覆盖的改进算法

An Improved Method to Extract Absolute Minimal Covers for Logic Functions

逻辑函数的绝对最小化算法存在的主要问题是运行时间过长和需要的存储空间过大．本文提出了一个从给定本源蕴涵项集合中抽出一个绝对最小覆盖的算法，而时间空间的需求被大大地缩小了．

This paper points Out that the requirements of too much processing time and memory space in the absolute minimization procedures are major problems. Presented is a new method to extract an absolute minimal cover from a given set of prime implicents with greatly reduced time and space requirement.