An exponential separation between the parity principle and the pigeonhole principle

Annals of Pure and Applied Logic

Volumn 80, Issue 3, 1996, Pages 195-228

  Beame, Paul ^a   Pitassi, Toniann ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030603006     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/0168-0072(96)83747-X     Document Type: Article

References (18)

1. [1] M. Ajtai, The complexity of the pigeonhole principle, Proc. 29th Ann. Symp. on Foundations of Computer Science, White Plains, New York (IEEE Press, New York, 1988) 346-355.
2. [2] M. Ajtai, Parity and the pigeonhole principle, in: S.R. Buss and P.J. Scott, eds., Feasible Mathematics, A Mathematical Sciences Institute Workshop, Ithaca, New York (Birkhäuser, Basel, 1990) 1-24.
3. [2a] Beame, Cook, Edmonds, Impagliazzo and Patalsi, The complexity of NP search porblems, Proc. 27th Ann. ACM Symp. on Theory of Computing, Las Vegas, NV, USA (1995) 303-314.
4. [3] P.W. Beame and J. Hâstad, Optimal bounds for decision problems on the CRCW PRAM, J. ACM 36 (1989) 643-670.
5. [4] P.W. Beame, R. Impagliazzo, J. Krajíček, T. Pitassi, P. Pudlák and A. Woods, Exponential lower bounds for the pigeonhole principle, Proc. 24th Ann. ACM Symp. on Theory of Computing, Victoria, BC, Canada (1992) 200-220.
6. [5] P. Beame and T. Pitassi, An exponential separation between the matching principle and the pigeonhole principle, Proc. 8th Ann. IEEE Symp. on Logic in Computer Science, Montreal, Quebec, 1993.
7. [6] S. Bellantoni, T. Pitassi and A. Urquhart, Approximation and small depth Frege proofs, Proc. Structure in Complexity Theory, 6th Ann. Conf., Chicago, IL (IEEE Press, New York, 1991) 367-391.
8. [7] S.R. Buss, Bounded Arithmetic, Vol. 3 Studies in Proof Theory (Bibliopolis, Napoli, 1986).
9. [8] S.R. Buss, Polynomial size proofs of the pigeonhole principle, J. Symbolic Logic 57 (1987) 916-927.
10. [9] S.A. Cook and R.A. Reckhow, The relative efficiency of propositional proof systems, J. Symbolic Logic 44 (1977) 36-50.
11. [10] A. Haken, The intractability of resolution, Theoret. Comput. Sci. 39 (1985) 297-305.
12. [11] J. Hâstad, Computational Limitations of Small-Depth Circuits (MIT Press, New York, 1987). ACM Doctoral Dissertation Award Series, 1986.
13. [12] J. Krajíček, P. Pudlák and A. Woods, Exponential lower bounds to the size of bounded-depth Frege proofs of the pigeonhole principle, Random Structures and Algorithms 7 (1995) 15-39.
14. [13] C.H. Papadimitriou, On inefficient proofs of existence and complexity classes, Proc. 4th Czechoslovakian Symp. on Combinatorics, 1991.
15. [14] T. Pitassi, The power of weak formal systems, Ph.D. Thesis, University of Toronto, August 1992.
16. [15] T. Pitassi, P. Beame and R. Impagliazzo, Exponential lower bounds for the pigeonhole principle, Comput. Complexity 3 (1993) 97-140.
17. [16] J. Paris and A. Wilkie, Counting problems in bounded arithmetic, in: Methods in Mathematical Logic: Proc. 6th Latin American Symposium on Mathematical Logic 1983, Lecture Notes in Mathematics, Vol. 1130 (Springer, Berlin, 1985) 317-340.
18. [17] A. Urquhart, Hard examples for resolution, J. ACM 34 (1987) 209-219.