Skip to Main content Skip to Navigation
Journal articles

Associative and commutative tree representations for Boolean functions

Abstract : Since the 1990s, the probability distribution on Boolean functions, induced by some random formulas built upon the connectives And and Or, has been intensively studied. These formulas rely on plane binary trees. We extend all the results, in particular the relation between the probability and the complexity of a function, to more general formula structures: non-binary or non-plane trees. These formulas satisfy the natural properties of associativity and commutativity.
Document type :
Journal articles
Complete list of metadata
Contributor : Hal Sorbonne Université Administateur Connect in order to contact the contributor
Submitted on : Wednesday, March 4, 2015 - 3:11:22 PM
Last modification on : Wednesday, October 13, 2021 - 7:58:04 PM

Links full text



Antoine Genitrini, Bernhard Gittenberger, Veronika Kraus, Cécile Mailler. Associative and commutative tree representations for Boolean functions. Theoretical Computer Science, Elsevier, 2015, 570, pp.70-101. ⟨10.1016/j.tcs.2014.12.025⟩. ⟨hal-01122776⟩



Les métriques sont temporairement indisponibles