About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
IEEE TC
Paper
Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification
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 2<sup>m</sup>- 1 implicants but no more. Copyright © 1986 by The Institute of Electrical and Electronics Engineers, Inc.