A note on the bottleneck counting argument

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1997, Pages 297-301

  Simon, J ^a   Tsai, Shi Chun ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b NATIONAL CHI NAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY;

APPROXIMATION METHODS; COUNTING TECHNIQUES; LOWER BOUNDS; MONOTONE CIRCUIT;

COMPUTATIONAL COMPLEXITY;

EID: 84878934339     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1997.612324     Document Type: Conference Paper

References (11)

1. N. Alon and R. B. Boppana. The monotone circuit complexity of boolean functions. Combinatorica, 7 (1): 1-22, 1987.
2. N. Alon, J. Spencer, and P. Erdos. The Probabilistic Method. John Wiley and Sons Inc., 1991.
3. A. E. Andreev. On a method for obtaining lower bounds for the complexity of individual monotone functions. Soviet Math. Dokl, 31: 530-534, 1985.
4. M. Golmann and J. Hastad. Monotone circuits for connectivity have depth (log n)2-1'. In Proc. 27th Annual ACM Symposium on the Theory of Computing, pages 569-574, 1995.
5. A. Haken. The intractability of resolution. Theoret. Comput. Sci., 39: 297-308, 1985.
6. A. Haken. Counting bottlenecks to show monotone P-NP. In Proc. 36th Symposium of Foundations of Computer Science, pages 36-40, 1995.
7. N. Pippinger. On networks of noisy gates. In Proc. 26th Symposium on Foundations of Computer Science, pages 30-38, 1985.
8. A. A. Razborov. Lower bounds on the monotone complexity of some boolean functions. Soviet Math. Dokl, 31: 354-357, 1985.
9. A. A. Razborov. On the method of approximations. In Proc. 21st Annual ACM Symposium on the Theory of Computing, pages 167-176, 1989.
10. I. Wegener. The Complexity of Boolean Functions. B. G. Teubner and John Wiley & Sons, 1987.
11. A. C. Yao. A lower bound for the monotone depth of connectivity. In Proc. 35th Symposium on Foundations of Computer Science, pages 302-308, 1994.