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

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 2^m- 1 implicants but no more. Copyright © 1986 by The Institute of Electrical and Electronics Engineers, Inc.