On the distribution of the number of monotone Boolean functions relative to the number of lower units

Discrete Mathematics

Volumn 257, Issue 2-3, 2002, Pages 463-479

  Korshunov, A D ^a,b   Shmulevich, I ^b  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b UNIVERSITY OF TEXAS   (United States)

Author keywords

Asymptotic; Disjunctive normal form; Lower unit; Monotone boolean function

Indexed keywords

EID: 31244435501     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00507-1     Document Type: Article

References (20)

1. J. Astola, P. Kuosmanen, Fundamentals of Nonlinear Digital Filtering, CRC Press, Boca Raton, FL, 1997.
2. N. Bshouty, C. Tamon, On the Fourier spectrum of monotone functions, J. ACM 43(4) (1996) 747-770.
3. S. Bublitz, U. Schürfeld, B. Voigt, I. Wegener, Properties of complexity measures for PRAMs and WRAMs, Theoret. Comput. Sci. 48(1) (1986) 53-73.
4. R. Dedekind, Über Zerlegungen von Zahlen durch ihre grössten gemeinsamen Teiler, Festschrift Hoch. Braunschweig Ges. Werke II (1897) 103-148.
5. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, Wiley, New York, 1968.
6. M. Gabbouj, E.J. Coyle, Minimum mean absolute error stack filtering with structural constraints and goals, IEEE Trans. Acoust. Speech Signal Process. 38(6) (1990) 955-968.
7. E. Gilbert, Lattice-theoretic properties of frontal switching functions, J. Math. Phys. 33 (1954) 57-67.
8. K. Hayase, On the Relationship between Boolean Functions and their Prime Implicants in OBDD Size, Sixth BDD Workshop, 1995.
9. K. Hayase, H. Imai, OBDDs of a monotone functions and of its prime implicants, Algorithms and Computation, Lecture Notes in Computer Science, Vol. 1178, Springer, Berlin, 1996, pp. 136-145.
10. D. Kleitman, On Dedekind's problem: the number of monotone Boolean functions, Proc. Amer. Math. Soc. 21(3) (1969) 677-682.
11. D. Kleitman, G. Markowsky, On Dedekind's problem: the number of isotone Boolean functions, II, Trans. Amer. Math. Soc. 213 (1975) 373-390.
12. A.D. Korshunov, On the number of monotone Boolean functions, Problemy Kibemetiki, Vol. 38, Moscow, Nauka, 1981, pp. 5-108 (in Russian).
13. B. Kovalerchuk, E. Triantaphyllou, A. Deshpande, E. Vityaev, Interactive learning of monotone Boolean functions, Inform. Sci. 94 (1996) 87-118.
14. K. Makino, T. Ibaraki, The maximum latency and identification of positive Boolean functions, SIAM J. Comput. 26(5) (1997) 1363-1383.
15. N.N. Nurmeev, On the complexity of the circuit realization of almost all monotone Boolean functions, Izv. Vyssh. Uchebn. Zaved. Mat. (5) (1985) 64-70 (in Russian).
16. A. Ostmann, Order and symmetry of simple games, Note Mat. XIII(2) (1993) 251-267.
17. I. Shmulevich, Properties and Application of Monotone Boolean Functions and Stack Filters, Ph.D. Thesis, Purdue University, August 1997.
18. V.A. Vardanian, On the complexity of signal dynamic tests for monotone Boolean functions, Kibemetika (Kiev) (3) (1987) 23-26 (in Russian).
19. P. Wendt, E. Coyle, N. Gallagher, Stack Filters, IEEE Trans. Acoustics Speech Signal Process. 34(4) (1986) 898-911.
20. D. Wiedemann, A Computation of the Eighth Dedekind Number, Order 8 (1991) 5-6.