Random Boolean expressions

Danièle Gardy (1)

1 PRISM - Parallélisme, Réseaux, Systèmes, Modélisation

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.

Mots clés: Boolean function; complexity; probability distribution for Boolean functions; probability of tautologies

Domaines: Logique en informatique [cs.LO]; Calcul formel [cs.SC]; Interface homme-machine [cs.HC]

Danièle Gardy. Random Boolean expressions. Computational Logic and Applications, CLA '05, 2005, Chambéry, France. pp.1-36, ⟨10.46298/dmtcs.3475⟩. ⟨hal-01183339⟩