A new proof of the weak pigeonhole principle

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 368-377

  Maciel, Alexis ^a   Pitassi, Toniann ^b   Woods, Alan R ^c  

^a CLARKSON UNIVERSITY   (United States)

^b University of Arizona   (United States)

^c UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DIAGONALIZATIONS; PIGEONHOLE PRINCIPLE; PROOF COMPLEXITY;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY;

POLYNOMIALS;

WEAK PIGEONHOLE PRINCIPLE;

EID: 0033723776     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335348     Document Type: Conference Paper

References (15)

1. P. Beame and S. Riis. More on the relative strength of counting principles. In P. W. Beame and S. R. Buss, editors, Proof Complexity and Feasible Arithmetics, volume 39 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 13-35. American Mathematical Society, 1998.
2. S. R. Buss. Polynomial size proofs of the propositional pigeonhole principle. J. Symbolic Logic, 52: 916-927, 1987.
3. S. R. Buss and T. Pitassi. Resolution and the weak pigeonhole principle. In Computer Science Logic, pages 149-156, 1997.
4. S. R. Buss and G. Turán. Resolution proofs of generalized pigeonhole principles. Theoret. Comput. Sci., 62: 311-317, 1988.
5. J. Krajíček. Lower bounds to the size of constant-depth propositional proofs. J. Symbolic Logic, 59: 73-86, 1994.
6. J. Krajíček. On the weak pigeonhole principle. Manuscript, August 1999.
7. J. Krajíček, P. Pudlák, and A. Woods. Exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle. Random Structures and Algorithms, 7: 15-39, 1995.
8. J. B. Paris and A. J. Wilkie. Counting problems in bounded arithmetic. In Methods in Mathematical Logic: Proceedings of the 6th Latin American Symposium on Mathematical Logic 1983, volume 1130 of Lectures Notes in Mathematics, pages 317-340, 1985.
9. J. B. Paris, A. J. Wilkie, and A. R. Woods. Provability of the pigeonhole principle and the existence of infinitely many primes. J. Symbolic Logic, 53: 1235-1244, 1988.
10. T. Pitassi, P. Beame, and R. Impagliazzo. Exponential lower bounds for the pigeonhole principle. Comput. Complexity, pages 97-140, 1993.
11. A. A. Razborov. Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic. Izvestiya of the R.A.N., 59 (1): 201-224, 1995.
12. A. A. Razborov and S. Rudich. Natural proofs. J. Comput. System Sci., 55:24-35, 1997. (Pubitemid 127433391)
13. A. A. Razborov, A. Wigderson, and A. C. Yao. Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 739-748, 1997.
14. S. Riis. A complexity gap for tree-resolution. Manuscript, September 1999.
15. A. J. Wilkie. Some results and problems on weak systems of arithmetic. In A. Macintyre, L. Pacholski, and J. Paris, editors, Logic Colloquium '77, pages 237-248. North-Holland, 1978.