Random Boolean expressions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Random Boolean expressions

Abstract

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.
Fichier principal
Vignette du fichier
dmAF0101.pdf (397.04 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01183339 , version 1 (12-08-2015)

Identifiers

Cite

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⟩

Collections

CNRS UVSQ
92 View
2452 Download

Altmetric

Share

Gmail Facebook X LinkedIn More