An exponential lower bound for the size of monotone real circuits

Journal of Computer and System Sciences

Volumn 58, Issue 2, 1999, Pages 326-335

  Haken, Armin ^a   Cook, Stephen A ^b  

^a Center for Discrete Mathematics and Theoretical Computer Science   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DIGITAL ARITHMETIC; FUNCTIONS; PROBLEM SOLVING;

MONOTONE ARITHMETIC CIRCUITS;

CIRCUIT THEORY;

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

References (15)

1. [AB87] N. Alon and R. B. Boppana, The monotone circuit complexity of Boolean functions, Combinatorica 7, No. 1 (1987), 1-22.
2. [And85] A. E. Andreev, On a method for obtaining lower bounds for the complexity of individual monotone functions, Dok. Akad. Nauk SSSR 282, No. 5 (1985), 1033-1037.
3. [Engl. Transl. Soviet Math. Dokl. 31 (1985), 530-534]
4. [BPR95] M. Bonet, T. Pitassi, and R. Raz, Lower bounds for cutting planes proofs with small coefficients, in "Proc. Twenty-seventh Ann. ACM Symp. Theor. Comput., 1995," pp. 575-584.
5. [BS90] R. B. Boppana and M. Sipser, The complexity of finite functions, in "Handbook of Theoretical Computer Science, Vol. A, Algorthms and Complexity" (J. van Leeuwen, Eds.), pp. 757-804, MIT Press, Cambridge, MA, 1990.
6. [CS88] V. Chvátal and E. Szemerédi, Many hard examples for resolution, J. Assoc. Comput. Mach. 35, No. 4 (1988), 759-768.
7. [CCT87] W. Cook, C. R. Coullard, and Gy. Turán, On the complexity of cutting plane proofs, Disc. Appl. Math. (1987), 25-38.
8. [Hak85] A. Haken, The intractability of resolution, Theoret. Comput. Sci. 39 (1985), 297-308.
9. [Hak95] A. Haken, Counting bottlenecks to show monotone P ≠ NP, in "Proc. 36th Annual Symp. Foundations of Computer Science, 1995," pp. 36-40.
10. [Pud95A] P. Pudlák, Direct proofs of interpolation theorems for resolution and cutting planes proof systems, manuscript, February 1995.
11. [Pud95B] P. Pudlák, Lower bounds for resolution and cutting plane proofs and monotone computations, J. Symbolic Logic 62, No. 3 (1997), 981-998.
12. [Raz85] A. A. Razborov, Lower bounds on the monotone complexity of some Boolean functions, Dokl. Akad. Nauk SSSR 281, No. 4 (1985), 798-801.
13. [Engl. Transl. Soviet Math. Dokl. 31 (1985), 354-357]
14. [Urq87] A. Urquhart, Hard examples for resolution, J. Assoc. Comput. Mach. 34, No. 1 (1987), 209-219.
15. [Weg87] I. Wegener, "The Complexity of Boolean Functions," Teubner/Wiley, New York, 1987.