Entropy and Enumeration of Boolean Functions

Authors

Nicholas Pippenger, Harvey Mudd CollegeFollow

Document Type

Article

Department

Mathematics (HMC)

Publication Date

9-1999

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.

Rights Information

© 1999 IEEE

DOI

10.1109/18.782146

Recommended Citation

Pippenger, N.; , "Entropy and enumeration of Boolean functions," Information Theory, IEEE Transactions on , vol.45, no.6, pp.2096-2100, Sep 1999.