Random Boolean expressions

We examine how we can define several probability distributions on the set of Boolean functions on a fixed number of variables, starting from a representation of Boolean expressions by trees. Analytic tools give us a systematic way to prove the existence of probability distributions, the main challen...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete mathematics and theoretical computer science Ročník DMTCS Proceedings vol. AF,...; číslo Proceedings; s. 1 - 36
Hlavní autor: Gardy, Danièle
Médium: Journal Article Konferenční příspěvek
Jazyk:angličtina
Vydáno: DMTCS 01.01.2005
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Edice:DMTCS Proceedings
Témata:
[info.info-hc] computer science [cs]/human-computer interaction [cs.hc]
[info.info-lo] computer science [cs]/logic in computer science [cs.lo]
[info.info-sc] computer science [cs]/symbolic computation [cs.sc]
boolean function
complexity
Computer Science
Human-Computer Interaction
Logic in Computer Science
probability distribution for boolean functions
probability of tautologies
Symbolic Computation
probability distribution for Boolean functions
complexity
Boolean function
probability of tautologies
ISSN:1365-8050, 1462-7264, 1365-8050
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í:We examine how we can define several probability distributions on the set of Boolean functions on a fixed number of variables, starting from a representation of Boolean expressions by trees. Analytic tools give us a systematic way to prove the existence of probability distributions, the main challenge being the actual computation of the distributions. We finally consider the relations between the probability of a Boolean function and its complexity.
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.3475