• DocumentCode
    1537999
  • Title

    Entropy and enumeration of Boolean functions

  • Author

    Pippenger, Nicholas

  • Author_Institution
    Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada
  • Volume
    45
  • Issue
    6
  • fYear
    1999
  • fDate
    9/1/1999 12:00:00 AM
  • Firstpage
    2096
  • Lastpage
    2100
  • Abstract
    Shannon´s notion of the entropy of a random variable is used to give simplified proofs of asymptotic formulas for the logarithms of the numbers of monotone Boolean functions and Horn (1951) functions, and for equivalent results concerning families of sets and closure operations
  • Keywords
    Boolean functions; entropy; random processes; set theory; Boolean functions; Horn functions; asymptotic formulas; closure operations; discrete random variable; entropy; logarithms; monotone Boolean functions; sets; Boolean functions; Computer science; Embryo; Entropy; Random variables;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.782146
  • Filename
    782146
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1537999