The boolean functions computed by random boolean formulas or how to grow the right function

Random Structures and Algorithms

Volumn 27, Issue 4, 2005, Pages 490-519

  Brodsky, Alex ^a   Pippenger, Nicholas ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b Princeton University   (United States)

Author keywords

Computational and structural complexity; Growth processes; Probabilistic amplification; Random Boolean functions

Indexed keywords

EID: 30544447454     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20095     Document Type: Article

References (25)

1. A. Andreev, On the problem of minimizing disjunctive normal forms, Sov Math Dokl 29 (1984), 32-36.
2. T. Apostol, Modular functions and Dirichlet series in number theory, 2nd edition, Springer, New York, 1997.
3. S. Berkowitz, On some relationships between monotone and nonmonotone circuit complexity, Technical report, Department of Computer Science, University of Toronto, Canada, Toronto, Canada, 1982.
4. R. Boppana, Amplification of probabilistic Boolean formulas, Proc 26th Annu IEEE Symp Foundations of Computer Science, October 1985, pp. 20-29.
5. R. Boppana, "Amplification of probabilistic Boolean formulasm" Advances in computing research 5: Randomness and computation, 28-45. S. Micali (Editor), JAI Press, Greenwich, CT, 1989.
6. M. Dubiner and U. Zwick, Amplification by read-once formulas, SIAM J Comput, 26(1) (1997), 15-38.
7. V. Glagolev, Certain estimates of disjunctive normal forms of functions of the algebra of logic. (Russian), Problemy Kibernetiki 19 (1967), 75-95.
8. G. Katona, "A theorem of finite sets", Theory of graphs, 187-207. P. Erdös and G. Katona (Editors), Akademia Kiado, Budapest, 1968.
9. A. Korshunov, The number of monotone Boolean functions. (Russian), Problemy Kibernetiki 38 (1980), 5-100.
10. J. Kruskal, "The optimal number of simplices in a complex," Mathematical optimization techniques, 251-268. University of California Press, Berkeley, California, 1963.
11. V. Kurdyavcev, Completeness theorem for a class of automata without feedback couplings. Sov Math Dokl 1 (1960), 537-539.
12. V. Kurdyavcev, Problems of completeness for automatic machine systems, Sov Math Dokl 1 (1960), 146-149.
13. H. Lefmann and P. Savický, Some typical properties of large and/or Boolean functions, Random Structures Algorithms 10 (1997), 337-351.
14. O. Lupanov, On the realization of functions of logical algebra by formulae of finite classes (formulae of limited depth) in the basis &,-, (Russian), Problemy Kibernetiki 6 (1961), 5-14.
15. E. Moore and C. Shannon, Reliable circuits using less reliable relays, J Franklin Inst 262(3) (1956), 191-208.
16. A. Razborov, Formulas of bounded depth in basis (∧, ⊕) and some combinatorial problems, Voprosy Kibernetiky, USSR (1988), Vol 134, 149-166.
17. J. Riordan and C. Shannon, The number of two-terminal series-parallel networks, J Math & Phys 21 (1942), 83-93.
18. A. Sapozhenko, The number of antichains in multilayered ranked sets. (Russian), Diskret Mat 1(1989), 110-128.
19. P. Savický, Random Boolean formulas representing any Boolean function with asymptotically equal probability, Discrete Math 83 (1990), 95-103.
20. P. Savický, Bent functions and random Boolean formulas, Discrete Math 147 (1995), 211-234.
21. P. Savický, Improved Boolean formulas for the Ramsey graphs, Random Structures Algorithms 6 (1995), 407-415.
22. P. Savický, Complexity and probability of some Boolean formulas, Combinat Probab Comput 7(4) (1998), 451-463.
23. C. Shannon, A symbolic analysis of relay and switching circuits, AIEE Trans 57 (1938), 713-723.
24. L. Valiant, Short monotone formulae for the majority function, J Algorithms 5 (1984), 363-366.
25. J. von Neumann, "Probabilistic logics and the synthesis of reliable organisms from unreliable components," Automata studies 43-98. C. Shannon and J. McCarthy (Editors), Princeton University Press, Princeton, NJ, 1956.