And/or trees revisited

Combinatorics Probability and Computing

Volumn 13, Issue 4-5, 2004, Pages 475-497

  Chauvin, B ^a   Flajolet, P ^b   Gardy, D ^c   Gittenberger, B ^d  

^a UNIVERSITÉ DE VERSAILLES SAINT QUENTIN EN YVELINES   (France)

^b INRIA ROCQUENCOURT   (France)

^c UNIVERSITY OF VERSAILLES   (France)

^d VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA STRUCTURES; ITERATIVE METHODS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS;

BINARY TREES; BOOLEAN VARIABLES;

TREES (MATHEMATICS);

EID: 6344221411     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548304006273     Document Type: Conference Paper

References (17)

1. Billingsley, P. (1995) Probability and Measure, 3rd edn, Wiley.
2. Buhrman, H. and de Wolf, R. (2002) Complexity measures and decision tree complexity: A survey. Theoret. Comput. Sci. 288 21-43.
3. Drmota, M. (1997) Systems of functional equations. Random Struct. Alg. 10 103-124.
4. Flajolet, P. and Odlyzko, A. M. (1990) Singularity analysis of generating functions. SIAM J. Discrete Math. 3 216-240.
5. Flajolet, P. and Sedgewick, R. (2001) Analytic combinatorics: Functional equations, rational and algebraic functions. Technical Report 4103, INRIA.
6. Friedman, J. (1992) Probabilistic spaces of boolean functions of a given complexity: Generalities and random k-sat coefficients. Technical Report CS-TR-387-92, Princeton University, Princeton, NJ.
7. Lalley, S. P. (1993) Finite range random walk on free groups and homogeneous trees. Ann. Probab. 21 2087-2130.
8. Lefmann, H. and Savický, P. (1997) Some typical properties of large and/or boolean formulas. Random Struct. Alg. 10 337-351.
9. Lyons, R., Pemantle, R. and Peres, Y. (1995) Conceptual proofs of l log l criteria for mean behavior of branching processes. Ann. Probab. 23 1125-1138.
10. Nguyên Thê, M. (2002) Distribution of the size of simplified or reduced trees. In Mathematics and Computer Science II, Birkhäuser.
11. Paris, J. B., Vencovská, A. and Wilmers, G. M. (1994) A natural prior probability distribution derived from the propositional calculus. Ann. Pure Appl. Logic 70 243-285.
12. Pólya, G. and Read, R. C. (1987) Combinatorial enumeration of Groups, Graphs and Chemical Compounds, Springer, New York.
13. Savický, P. (1990) Random boolean formulas representing any boolean function with asymptotically equal probability. Discrete Math. 83 95-103.
14. Savický, P. (1995) Bent functions and random boolean formulas. Discrete Math. 147 211-234.
15. Savický, P. (1998) Complexity and probability of some boolean formulas. Combin. Probab. Comput. 7 451-463.
16. Savický, P. and Woods, A. (1998) The number of boolean functions computed by formulas of a given size. Random Struct. Alg. 13 349-382.
17. Woods, A. (1997) Coloring rules for finite trees, and probabilities of monadic second order sentences. Random Struct. Alg. 10 453-485.