• DocumentCode
    889886
  • Title

    Minimizability of random Boolean functions

  • Author

    Fleisher, H. ; Giraldi, J. ; Phoenix, R. ; Tavel, M.

  • Author_Institution
    Dept. of Phys., State Univ. of New York, New Paltz, NY, USA
  • Volume
    38
  • Issue
    4
  • fYear
    1989
  • fDate
    4/1/1989 12:00:00 AM
  • Firstpage
    593
  • Lastpage
    595
  • Abstract
    The average number of prime k-cubes and essential k -cubes in an n-variable, single-output Boolean function has already been obtained combinationally. The authors show how the same quantities can be obtained geometrically, using the theory of random clumping and take an initial step in calculating, for k-cubes in the minimized form of a function. The authors compare their results to minimizations produced by ESPRESSO and a cruder algorithm
  • Keywords
    Boolean functions; minimisation; ESPRESSO; essential k-cubes; n-variable; prime k-cubes; random Boolean functions; random clumping; Astronomy; Boolean functions; Guidelines; Hardware; Hypercubes; Minimization methods; Physics; Process design;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.21151
  • Filename
    21151
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=889886