Entropy and enumeration of Boolean functions

  • Authors:

  • H. Pippenger

  • Affiliations:

  • Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

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