Entropy and enumeration of Boolean functions

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.

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 45; číslo 6; s. 2096 - 2100
Hlavní autor: Pippenger, H.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.09.1999
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Boolean functions
Entropy
Functions
Mathematical models
Variables
ISSN:0018-9448, 1557-9654
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.782146