The number of Boolean functions computed by formulas of a given size

Random Structures and Algorithms

Volumn 13, Issue 3-4, 1998, Pages 349-382

  Savický, Petr ^a   Woods, Alan R ^b  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

^b UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032221896     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199810/12)13:3/4<349::AID-RSA9>3.0.CO;2-V     Document Type: Article

References (33)

1. D. Angluin, L. Hellerstein, and M. Karpinski, Learning read-once formulas with queries, J. Assoc. Comput. Mach., 40, 185-210 (1993).
2. A. Cayley, On the theory of the analytical forms called trees, Philos. Mag., 13, 172-176 (1857).
3. L. Comtet, Sur le quatrième problème et les nombres de Schröder, C. R. Acad. Sci. Paris Sér. A Math., 271, 913-916 (1970).
4. P. E. Dunne, The Complexity of Boolean Networks, Academic Press, London, 1988.
5. T. Eiter, Generating μ-expressions, Acta Inform., 32, 171-187 (1995).
6. L. R. Foulds and R. W. Robinson, Enumeration of phylogenetic trees without points of degree two, Ars Combin., 17A, 169-183 (1984).
7. 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.
8. F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, New York, 1973.
9. F. Harary, R. W. Robinson, and A. J. Schwenk, Twenty-step algorithm for determining the asymptotic number of trees of various species, J. Austral. Math. Soc. Ser. A, 20, 483-503 (1975).
10. H. B. Hunt and R. E. Stearns, The complexity of very simple Boolean formulas with applications, SIAM J. Comput. 19, 44-70 (1990).
11. H. Lefmann and P. Savický, Some typical properties of large AND/OR Boolean formulas, Proceedings of the MFCS'95, Lecture Notes in Computer Science, Vol. 969, Springer, Berlin, 1995, pp. 237-246.
12. O. B. Lupanov, Complexity of formula realization of functions of logical algebra, Problemy Kibernetiki, 3, 61-80 (1960); English transi. Prob. Cybernetics, 3, 782-811 (1962).
13. O. B. Lupanov, Complexity of formula realization of functions of logical algebra, Problemy Kibernetiki, 3, 61-80 (1960); English transi. Prob. Cybernetics, 3, 782-811 (1962).
14. -, Problemy Kibernetiki, 6, 5-14 (1961); English transl., Prob. Cybernetics, 6, 1-14 (1965).
15. -, Problemy Kibernetiki, 6, 5-14 (1961); English transl., Prob. Cybernetics, 6, 1-14 (1965).
16. P. A. MacMahon, The combination of resistances, The Electrician, 28, 601-602 (1892).
17. A. I. Markushevich, Theory of Functions of a Complex Variable, Vol. II, Prentice-Hall, Englewood Cliffs, NJ, 1965.
18. J. W. Moon, Some enumerative results on series-parallel networks, in Random Graphs '85, North-Holland, Amsterdam, 1987, pp. 199-226.
19. D. Mundici, Solution of Rota's problem on the order of series-parallel networks, Adv. in Appl. Math., 12, 455-463 (1991).
20. R. Otter, The number of trees, Ann. of Math., 49, 583-599 (1948).
21. J. B. Paris, A. Vencovská, and G. M. Wilmers, A natural prior probability distribution derived from the prepositional calculus, Ann. Pure Appl. Logic, 70, 243-285 (1994).
22. G. Pólya, Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen. Acta Math., 68, 145-254 (1937).
23. G. Pólya and R. C. Read, Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds, Springer-Verlag, New York, 1987.
24. J. Riordan, An Introduction to Combinatorial Analysis, Wiley, New York, 1958.
25. J. Riordan and C. E. Shannon, The number of two terminal series-parallel networks, J. Math. Phys., 21, 83-93 (1942).
26. J. E. Savage, The Complexity of Computing, Wiley, New York, 1976.
27. P. Savický, Complexity and probability of some Boolean formulas, preprint, 1996.
28. E. Schröder, Vier combinatorische Probleme, Z. Math. Phys., 15, 361-376 (1870).
29. R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1996.
30. C. E. Shannon, The synthesis of two-terminal switching circuits, Bell Syst. Tech. J, 28, 59-98 (1949).
31. I. Wegener, The Complexity of Boolean Functions, Wiley-Teubner, Stuttgart, 1987.
32. H. S. Wilf, generatingfunctionology, Academic Press, Boston, 1990.
33. A. R. Woods, Coloring rules for finite trees, and probabilities of monadic second order sentences, Random Struct. Alg., 10, 453-485 (1997).