And/or tree probabilities of Boolean functions - 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

And/or tree probabilities of Boolean functions


We consider two probability distributions on Boolean functions defined in terms of their representations by $\texttt{and/or}$ trees (or formulas). The relationships between them, and connections with the complexity of the function, are studied. New and improved bounds on these probabilities are given for a wide class of functions, with special attention being paid to the constant function $\textit{True}$ and read-once functions in a fixed number of variables.
Fichier principal
Vignette du fichier
dmAD0113.pdf (112.61 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

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



Danièle Gardy, Alan Woods. And/or tree probabilities of Boolean functions. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.139-146, ⟨10.46298/dmtcs.3355⟩. ⟨hal-01184027⟩
69 View
600 Download



Gmail Facebook Twitter LinkedIn More