Title :
Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification
Author :
McMullen, C. ; Shearer, J.
Author_Institution :
Department of Mathematics, Massachusetts Institute of Technology
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.
Keywords :
Boolean functions; Logic; Mathematics; Polynomials; Size measurement;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1986.1676828
