Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification

Authors:
C. McMullen;J. Shearer
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;IBM T. J. Watson Research Center, Yorktown Heights, NY
Venue:
IEEE Transactions on Computers
Year:
1986

Citing 1
Cited 5

Logic Design and Switching Theory

Logic Design and Switching Theory

PALMINI—fast Boolean minimizer for personal computers

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Doing two-level logic minimization 100 times faster

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Two-level logic minimization

Logic Synthesis and Verification
Knowledge discovery with second-order relations

Knowledge and Information Systems
Restructuring decision tables for elucidation of knowledge

Data & Knowledge Engineering

Quantified Score

Hi-index	14.98

Visualization

Abstract

We show that any Boolean function f which can be expressed in a sum-of-products form using m product terms can contain as many as 2m- 1 implicants but no more.