Title :
Entropy and enumeration of Boolean functions
Author :
Pippenger, Nicholas
Author_Institution :
Dept. of Comput. Sci., British Columbia Univ., Vancouver, BC, Canada
fDate :
9/1/1999 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
