Some typical properties of large AND/OR Boolean formulas

Random Structures and Algorithms

Volumn 10, Issue 3, 1997, Pages 337-351

  Lefmann, Hanno ^a   Savický, Petr ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031504609     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199705)10:3<337::AID-RSA4>3.0.CO;2-X     Document Type: Article

References (13)

1. R. B. Boppana, Amplification of probabilistic Boolean formulas, Proc. 26th Ann. IEEE Symp. Foundations of Computer Science, 1985, pp. 20-29.
2. J. Friedman, Probabilistic spaces of Boolean functions of a given complexity: generalities and random k-SAT coefficients, Research Report CS-TR-387-92, Princeton University, Princeton, NJ, 1992.
3. A. N. Kolmogorov, Foundations of the Theory of Probability, Chelsea, New York, 1950.
4. J. B. Paris, A. Vencovská, and G. M. Wilmers, A natural prior probability distribution derived from the propositional calculus, Ann. Pure Appl. Logic, 70, 243-285 (1994).
5. Y. Rabani, Y. Rabinovich, and A. Sinclair, A computational view of population genetics, Proc. 27th Ann. ACM Symp. Theory of Computing, 1995, pp. 83-92.
6. Y. Rabinovich, A. Sinclair, and A. Wigderson, Quadratic dynamical systems, Proc. 33rd Ann. IEEE Symp. Foundations of Computer Science, 1992, pp. 304-313.
7. A. A. Razborov, Bounded-depth Formulae over {∧, ⊕}and some combinatorial problems, in Complexity of Algorithms and Applied Mathematical Logic (in Russian). Ser. Voprosy Kibernetiky (Problems in Cybernetics), S. I. Adian, Ed., Moscow, 1988, pp. 149-166.
8. P. Savický, Bent functions and random Boolean formulas, Discrete Math., 147, 211-234 (1995).
9. P. Savický, Improved Boolean formulas for the Ramsey graphs, Random Struct. Alg., 6, 407-415 (1995).
10. P. Savický, Complexity and probability of some Boolean formulas, TR 679, Institute of CS, Prague, http://www.uivt.cas.cz, 1996.
11. L. G. Valiant, Short monotone formulae for the majority function, J. Alg., 5, 363-366 (1984).
12. A. Woods, personal communication, 1995.
13. A. Woods, Colouring rules for finite trees and probabilities of monadic second-order sentences, preprint, 1996.