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

@article{McMullen1986PrimeIM,
  title={Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification},
  author={C. McMullen and J. Shearer},
  journal={IEEE Transactions on Computers},
  year={1986},
  volume={C-35},
  pages={761-762}
}
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. 
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

An improved lower bound on the maximum number of prime implicants

  • G. Pulzolv
  • 1979

The problem of bounding the length of reduced disjunctive normal forms

  • S. Y. Yablonskii
  • 1977

Similar Papers

Loading similar papers…