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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete mathematics and theoretical computer science Jg. DMTCS Proceedings vol. AF,...; H. Proceedings; S. 1 - 36
1. Verfasser:	Gardy, Danièle
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	DMTCS 01.01.2005 Discrete Mathematics and Theoretical Computer Science Discrete Mathematics & Theoretical Computer Science
Schriftenreihe:	DMTCS Proceedings
Schlagworte:	[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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!