A sprouting tree model for random boolean functions


We define a new probability distribution for Boolean functions of k variables. Consider the random Binary Search Tree of size n, and label its internal nodes by connectives and its leaves by variables or their negations. This random process defines a random Boolean expression which represents a random Boolean function. Finally, let n tend to infinity: the… (More)
DOI: 10.1002/rsa.20567


6 Figures and Tables

Cite this paper

@article{Chauvin2015AST, title={A sprouting tree model for random boolean functions}, author={Brigitte Chauvin and Dani{\`e}le Gardy and C{\'e}cile Mailler}, journal={Random Struct. Algorithms}, year={2015}, volume={47}, pages={635-662} }