Associative and commutative tree representations for Boolean functions - Archive ouverte HAL Access content directly
Journal Articles Theoretical Computer Science Year : 2015

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.

Dates and versions

hal-01122776 , version 1 (04-03-2015)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More