On the bottleneck counting argument

Theoretical Computer Science

Volumn 237, Issue 1-2, 2000, Pages 429-437

  Simon, Janos ^a   Tsai, Shi Chun ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

Circuit complexity; Computational complexity; Monotone circuit complexity

Indexed keywords

EID: 0347269445     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00321-7     Document Type: Article

References (15)

1. N. Alon, R.B. Boppana, The monotone circuit complexity of boolean functions, Combinatorica 7 (1) (1987) 1-22.
2. N. Alon, J. Spencer, P. Erdos, in: The Probabilistic Method, Wiley, New York, 1991.
3. K. Amano, A. Maruoka, Potential of the approximation method, Proc. 37th Symp. on Foundations of Computer Science, 1996, pp. 431-440.
4. A.E. Andreev, On a method for obtaining lower bounds for the complexity of individual monotone functions, Soviet Math. Dokl. 31 (1985) 530-534.
5. C. Berg, S. Ulfberg, Symmetric approximation arguments for monotone lower bounds without sunflowers, Computat. Complexity, in preparation.
6. M. Golmann, J. Håstad, Monotone circuits for connectivity have depth (logn)2 - o(1), Proc. 27th Ann. ACM Symp. the Theory of Computing, 1995, pp. 569-574.
7. A. Haken, The intractability of resolution, Theoret. Comput. Sci. 39 (1985) 297-308.
8. A. Haken, Counting bottlenecks to show monotone P ≠ NP, Proc. 36th Symp. on Foundations of Computer Science, 1995, pp. 36-40.
9. S. Jukna, Finite limits and monotone computations over reals, Proc. 12th Ann. IEEE Conf. on Computational Complexity, 1997, pp. 302-313.
10. M. Karchmer, On proving lower bounds for circuit size, Proc. 8th Ann. IEEE Conf. of Structure in Complexity Theory, 1993, pp. 112-118.
11. N. Pippinger, On networks of noisy gates, Proc. 26th Symp. Foundations of Computer Science, 1985, pp. 30-38.
12. A.A. Razborov, Lower bounds on the monotone complexity of some boolean functions, Soviet Math. Dokl. 31 (1985) 354-357.
13. A.A. Razborov, On the method of approximations, Proc. 21st Ann. ACM Symp. on the Theory of Computing, 1989, pp. 167-176
14. I. Wegener, in: The Complexity of Boolean Functions, Teubner, Stuggart, 1987.
15. A.C. Yao, A lower bound for the monotone depth of connectivity, Proc. 35th Symp. on Foundations of Computer Science, 1994, pp. 302-308.