Lower bounds for the weak pigeonhole principle beyond resolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 1005-1016

  Atserias, Albert ^a   Bonet, María Luisa ^a   Esteban, Juan Luis ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; COMPUTATIONAL LINGUISTICS;

CNF FORMULAS; LITERALS; LOWER BOUNDS; PIGEONHOLE PRINCIPLE;

AUTOMATA THEORY;

EID: 23044525713     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_81     Document Type: Conference Paper

References (15)

1. N. Alon and R. Boppana. The monotone circuit complexity of boolean functions. Combinatorica, 7(1):1-22, 1987.
2. P. Beame, R. Impagliazzo, J. Kraj́cek, T. Pitassi, P. Pudĺak, and A. Woods. Exponential lower bounds for PHP. In STOC92, pages 200-220, 1992.
3. P. Beame, R. Karp, T. Pitassi, and M. Saks. The efficiency of resolution and Davis-Putnam procedures. Submitted. Previous version in STOC'98, 1999.
4. P. Beame and T. Pitassi. Simplified and improved resolution lower bounds. In FOCS96, pages 274-282, 1996.
5. E. Ben-Sasson and A. Wigderson. Short proofs are narrow: Resolution made simple. In STOC99, pages 517-527, 1999. Revised version (2000).
6. M. Bonet, T. Pitassi, and R. Raz. Lower bounds for cutting planes proofs with small coefficients. The Journal of Symbolic Logic, 62(3):708-728, Sept. 1997.
7. S. Buss and T. Pitassi. Resolution and the weak pigeonhole principle. In CSL: 11th Workshop on Computer Science Logic. LNCS, Springer-Verlag, 1997.
8. S. R. Buss. Polynomial size proofs of the propositional pigeonhole principle. The Journal of Symbolic Logic, 52(4):916-927, Dec. 1987.
9. S. R. Buss and G. Tuŕan. Resolution proofs on generalized pigeonhole principles. Theoretical Computer Science, 62(3):311-317, Dec. 1988.
10. V. Chv́atal and E. Szemeŕedi. Many hard examples for resolution. J. ACM, 35(4):759-768, 1988.
11. G. Grimmet and D. Stirzaker. Probability and Random Processes. Oxford, 1982.
12. A. Haken. The intractability of resolution. TCS, 39(2-3):297-308, Aug. 1985.
13. J. Kraj́cek. On the weak PHP. To appear in Fundamenta Mathematic, 2000.
14. A. Maciel, T. Pitassi, and A. Woods. A new proof of the weak pigeonhole principle. In STOC00, pages 368-377, 2000.
15. J. B. Paris, A. J. Wilkie, and A. R. Woods. Provability of the pigeonhole principle and the existence of infinitely many primes. The Journal of Symbolic Logic, 53(4):1235-1244, 1988.