Publication
IEEE TC
Paper

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

View publication

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.

Date

01 Jan 1986

Publication

IEEE TC

Authors

Share