Resolution lower bounds for the weak functional pigeonhole principle

Theoretical Computer Science

Volumn 303, Issue 1, 2003, Pages 233-243

  Razborov, Alexander A ^a  

^a STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; THEOREM PROVING;

PIGEONHOLE PRINCIPLE;

COMPUTER SCIENCE;

EID: 0038717054     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00453-X     Document Type: Conference Paper

References (21)

1. M. Alekhnovich, E. Ben-Sasson, A. Razborov, A. Wigderson, Pseudorandom generators in propositional complexity, in: Proc. 41st IEEE FOCS, 2000, pp. 43-53.
2. P. Beame, T. Pitassi, Simplified and improved resolution lower bounds, in: Proc. 37th IEEE FOCS, 1996, pp. 274-282.
3. P. Beame, T. Pitassi, Propositional proof complexity: past, present and future, Technical Report TR98-067, Electronic Colloquium on Computational Complexity, 1998.
4. Ben-Sasson E., Wigderson A. Short proofs are narrow - resolution made simple. J. ACM. 48(2):2001;149-169.
5. A. Blake, Canonical expressions in Boolean algebra, Ph.D. Thesis, University of Chicago, 1937.
6. Buss S., Pitassi T. Resolution and the weak pigeonhole principle. Proc. CSL97. Lecture Notes in Computer Science. Vol. 1414:1997;149-156 Springer, New York, Berlin.
7. Buss S., Turán G. Resolution proofs of generalized pigeonhole principle. Theoret. Comput. Sci. 62:1988;311-317.
8. Chvátal V., Szemerédi E. Many hard examples for resolution. J. ACM. 35(4):1998;759-768.
9. M. Clegg, J. Edmonds, R. Impagliazzo, Using the Groebner basis algorithm to find proofs of unsatisfiability, in: Proc. 28th ACM STOC, 1996, pp. 174-183.
10. Davis M., Putnam H. A computing procedure for quantification theory. J. ACM. 7(3):1960;210-215.
11. Haken A. The intractability or resolution. Theoret. Comput. Sci. 39:1985;297-308.
12. Jukna S. Exponential lower bounds for semantic resolution. Beame P., Buss S. Proof Complexity and Feasible Arithmetics: DIMACS Workshop, April 21-24, 1996. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 39:1997;163-172 American Mathematical Society, Providence, RI.
13. T. Pitassi, R. Raz, Regular resolution lower bounds for the weak pigeonhole principle, in: Proc. 33rd ACM Symp. on the Theory of Computing, 2001, pp. 347-355.
14. R. Raz, Resolution lower bounds for the weak pigeonhole principle, Technical Report TR01-021, Electronic Colloquium on Computational Complexity, 2001.
15. Razborov A. Lower bounds for propositional proofs and independence results in bounded arithmetic. Meyer auf der Heide F., Monien B. Proc. 23rd ICALP. Lecture Notes in Computer Science. Vol. 1099:1996;48-62 Springer, New York, Berlin.
16. A. Razborov, Improved resolution lower bounds for the weak pigeonhole principle, Technical Report TR01-055, Electronic Colloquium on Computational Complexity, 2001, Available at ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/2001/TR01-055/index.html.
17. A. Razborov, Resolution lower bounds for perfect matching principles, Manuscript, available at http://www.mi.ras.ru/̃razborov/matching.ps, 2001.
18. A. Razborov, A. Wigderson, A. Yao, Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus, in: Proc. 29th ACM Symp. on Theory of Computing, 1997, pp. 739-748.
19. Robinson J.A. A machine-oriented logic based on the resolution principle. J. ACM. 12(1):1965;23-41.
20. G.C. Tseitin, On the complexity of derivations in propositional calculus, in: Studies in Constructive Mathematics and Mathematical Logic, Part II, Consultants Bureau, New York, London, 1968.
21. Urquhart A. Hard examples for resolution. J. ACM. 34(1):1987;209-219.