A sprouting tree model for random boolean functions
- 31 July 2014
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 47 (4) , 635-662
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Tautologies over implication with negative literalsMathematical Logic Quarterly, 2010
- Analytic urnsThe Annals of Probability, 2005
- Martingales and Profile of Binary Search TreesElectronic Journal of Probability, 2005
- Monotone Boolean formulas can approximate monotone linear threshold functionsDiscrete Applied Mathematics, 2004
- Occupancy urn models in the analysis of algorithmsJournal of Statistical Planning and Inference, 2002
- Statistical properties of simple typesMathematical Structures in Computer Science, 2000
- Coloring rules for finite trees, and probabilities of monadic second order sentencesRandom Structures & Algorithms, 1997
- A natural prior probability distribution derived from the propositional calculusAnnals of Pure and Applied Logic, 1994
- Finite Range Random Walk on Free Groups and Homogeneous TreesThe Annals of Probability, 1993
- Note on the Derivatives with Respect to a Parameter of the Solutions of a System of Differential EquationsAnnals of Mathematics, 1919