• DocumentCode
    1154191
  • 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
  • Issue
    8
  • fYear
    1986
  • Firstpage
    761
  • Lastpage
    762
  • 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;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1986.1676828
  • Filename
    1676828
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1154191