Danièle Gardy ; Alan Woods - And/or tree probabilities of Boolean functions

dmtcs:3355 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms - https://doi.org/10.46298/dmtcs.3355
And/or tree probabilities of Boolean functionsArticle

Authors: Danièle Gardy ORCID1; Alan Woods 2

  • 1 Parallélisme, Réseaux, Systèmes, Modélisation
  • 2 School of Mathematics and Statistics [Crawley, Perth]

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.


Volume: DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: Boolean formula,And/Or tree,tree enumeration,tautology,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG],[INFO.INFO-HC] Computer Science [cs]/Human-Computer Interaction [cs.HC]

3 Documents citing this article

Consultation statistics

This page has been seen 245 times.
This article's PDF has been downloaded 230 times.