Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus

Combinatorica

Volumn 22, Issue 4, 2002, Pages 555-574

  Razborov, Alexander ^a   Wigderson, Avi ^b   Yao, Andrew ^c  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^c Princeton University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037000647     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-002-0007-7     Document Type: Article

References (24)

1. P. BEAME AND T. PITASSI: Simplified and improved resolution lower bounds, In Proceedings of the 37th IEEE FOCS, 274-282, 1996.
2. A. BLAKE: Canonical expressions in Boolean algebra, PhD thesis, University of Chicago, 1937.
3. A. BORODIN and S. COOK: A time-space trade-off for sorting on a general sequential model of computation, SIAM J. on Computing, 11 (1982), 287-297.
4. S. BUSS: Polynomial size proofs of the propositional pigeonhole principle, Journal of Symbolic Logic, 52 (1987), 916-927.
5. S. BUSS and T. PITASSI: Resolution and the weak pigeonhole principle, Manuscript, 1996.
6. S. BUSS and G. TURÁN: Resolution proofs of generalized pigeonhole principle, Theoretical Computer Science, 62 (1988), 311-317.
7. V. CHVÁTAL: Determining the stable set number of a graph, SIAM J. on Computing, 6 (1977), 1-14.
8. V. CHVÁTAL and E. SZEMERÉDI: Many hard examples for resolution, Journal of the ACM, 35(4) (1988), 759-768.
9. M. DAVIS and H. PUTNAM: A computing procedure for quantification theory, Journal of the ACM, 7(3) (1960), 210-215.
10. G. HAJÓS: Über eine Konstruktion nicht n-färbbarer Graphen, Wiss. Zeitschr. Martin Luther Univ. Halle-Wittenberg, 10 (1961), 116-117.
11. A. HAKEN: The intractability or resolution, Theoretical Computer Science, 39 (1985), 297-308.
12. S. JUKNA: Exponential lower bounds for semantic resolution, In: Proof Complexity and Feasible Arithmetics: DIMACS workshop, April 21-24, 1996, DIMACS Series in Dicrete Mathematics and Theoretical Computer Science, (eds.: P. Beame and S. Buss), vol. 39, 163-172. American Math. Soc., 1997.
13. J. KRAJÍČEK: Bounded arithmetic, prepositional logic and complexity theory, Cambridge University Press, 1994.
14. L. LOVÁSZ and I. NEWMAN and M. NAOR and A. WIGDRESON: Search Problems in the Decision Tree Model SIAM J. on Discrete Math., 8 (1995), 119-132.
15. C. McDIARMID: Determining the chromatic number of a graph, SIAM J. on Computing, 8 (1979), 643-662.
16. E. A. Okolnishnikova, Lower bounds for branching programs computing characteristic functions of binary codes, Metody discretnogo analiza, 51 (1991), 61-83 (in Russian).
17. T. PITASSI and A. URQUHART: The complexity of the Hajós calculus, In: Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, 187-196. 1992.
18. A. RAZBOROV: Lower bounds for deterministic and nondeterministic branching programs, In: Proceedings of the 8th FCT, Lecture Notes in Computer Science, 529, 47-60, New York/Berlin, 1991, Springer-Verlag.
19. J. A. ROBINSON: A machine-oriented logic based on the resolution principle, Journal of the ACM, 12(1) (1965), 23-41.
20. Engl. translation: G. C. TSEITIN: On the complexity of derivations in propositional calculus, in: Studies in mathematics and mathematical logic, Part II, ed. A. O. Slissenko, 115-125.
21. A. URQUHART: Hard examples for resolution, Journal of the ACM, 34(1) (1987), 209-219.
22. I. WEGENER: The complexity of Boolean functions, Wiley-Teubner, 1987.