Better Lower Bounds for Monotone Threshold Formulas

Journal of Computer and System Sciences

Volumn 54, Issue 2, 1997, Pages 221-226

  Radhakrishnan, Jaikumar ^a,b  

^a RUTGERS UNIVERSITY   (United States)

^b TATA INSTITUTE OF FUNDAMENTAL RESEARCH   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; BOUNDARY ELEMENT METHOD; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; TREES (MATHEMATICS);

MONOTONE THRESHOLD FORMULAS;

THRESHOLD LOGIC;

EID: 0031117877     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1287     Document Type: Article

References (28)

1. M. Ajtai, J. Komlôs, and E. Szemerédi, Sorting in c log n parallel steps, Combinatorica 3 (1983), 1-19.
2. R. B. Boppana, Amplification of probabilistic Boolean formulas, Adv. Comput. Res. 5 (1989) 27-45.
3. R. B. Boppana and M. Sipser, The Handbook of Theoretical Computer Science" (J. van Leeuwen, Ed.), Chap. 14, pp. 759-804, Elsevier Science, New York, 1990.
4. M. Dubiner and U. Zwick, Amplification and percolation, in "Proceedings, 33rd IEEE FOCS, 1992," pp. 258-267.
5. M. Fredman and J. Komlòs, On the size of separating systems and perfect hash functions, SIAM J. Alg. Discrete Methods 5 (1984), 61-68.
6. M. J. Fischer, A. R. Meyer, and M. S. Paterson, Ω(n log n) lower bounds on the length of Boolean formulas, SIAM J. Comput. 11, No. 3, (1982), 416-427.
7. n," Research Report IS-RR-93-003F, Japan Advanced Institute of Science and Technology, 1993.
8. G. Hansel, Nombre minimal de contacts de fermature nécessaires pour réaliser une fonction booléenne symmétrique de n varables, C.R. Acad. Sci. Paris 258 (1964), 6037-6040.
9. M. A. Harrison, "Introduction to Switching and Automata Theory," Series in Systems Science, McGraw-Hill, New York, 1956.
10. M. Karchmer, "Communication Complexity: A New Approach to Circuit Depth," MIT Press, Cambridge, MA, 1989.
11. M. Karchmer and A. Wigderson, Monotone circuits for connectivity require superlogarithmic depth, in "Proceedings, ACM STOC, 1988, pp. 539-550.
12. V. M. Krapchenko, A method of obtaining lower bounds for the complexity π-schemes, Math. Notes Acad. Sci. USSR 11 (1972), 474-479.
13. R. E. Krichevskii, Complexity of contact circuits realizing a function of logical algebra, Sov. Phys. Dokl. 8 (1964), 770-772.
14. O. B. Lupanov, On comparing the complexity of realization of monotone contact networks containing only closing contacts and by arbitrary contact networks, Sov. Phys. Dokl. 7 (1962), 486-489.
15. O. B. Lupanov, On computing symmetric functions of the propositional calculus by switching networks, Problemy Kibernet. 15 (1965), 85-100. [Russian]
16. A. A. Markov, On minimal contact-rectifier bipolar circuits for monotone symmetric functions, Problemy Kibernet. 8 (1962), 117-121.
17. I. Newman, P. Ragde, and A. Wigderson, Perfect hashing, graph entropy and circuit complexity, in "Proceedings, Fifth Annual Conference on Structure in Complexity Theory, 1990," pp. 91-99.
18. M. S. Paterson, N. Pippenger, and U. Zwick, Optimal carry save networks, in "Boolean Function Complexity," LMS Lecture Note Series, Vol. 169, pp. 174-201, Cambridge Univ. Press, 1992.
19. N. Pippenger, An information-theoretic method in combinatorial theory, J. Combin. Theory, Ser. A 23 (1977) 99-104.
20. P. Pudlák, Bounds for Hodes-Speckor theorem, "Logic and Machines: Decision Problems and Complexity," Lect. Notes in Comput. Sci., Vol. 171, Springer-Verlag, Berlin, 1984.
21. A. A. Razborov, Lower bounds of the complexity of symmetric Boolean functions of contact-rectifier circuits, Math. Notes Acad. Sci. USSR 48, No. 6 (1990), 1226-1234.
22. A. A. Razborov, Lower bounds for deterministic and nondeterministic branching programs, in "Proceedings, 8th FCT," Lect. Notes in Comput. Sci., Vol. 529, Springer-Verlag, New York/Berlin, pp. 47-60, 1991.
23. J. Radhakrishnan, Improved bounds for covering complete uniform hypergraphs, Inform. Process. Lett. 41 (1992), 203-207.
24. J. Radhakrishnan and K. V. Subrahmanyam, "Better Directed Monotone Contact Networks for Threshold Functions," Technical Report (93/1), Tata Institute of Fundamental Research, 1993.
25. C. Shannon, The synthesis of two-terminal switching circuits, Bell systems Tech. J. 28, No. 1 (1949), 59-98.
26. M. Snir, The covering problem of complete uniform hypergraphs, Discrete Math. 27 (1979), 103-105.
27. L. G. Valiant, Short monotone formulae for the majority function, J. Algorithms 5 (1984), 363-366.
28. I. Wegener, "The Complexity of Boolean Functions," Series in Computer Science, Wiley-Teubner, New York/Stuttgart, 1987.