Lower bounds for the weak pigeonhole principle and random formulas beyond resolution

Information and Computation

Volumn 176, Issue 2, 2002, Pages 136-152

  Atserias, Albert ^a   Bonet, Maria Luisa ^a   Esteban, Juan Luis ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Lower bounds; Martingales; Monotone interpolation; Proof complexity; Random restrictions; Resolution

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; INTERPOLATION; POLYNOMIALS; THEOREM PROVING;

LOWER BOUNDS; MONOTONE INTERPOLATION; WEAK PIGEONHOLE PRINCIPLE;

RANDOM PROCESSES;

EID: 0036707278     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2002.3114     Document Type: Article

References (19)

1. Alon, N., and Boppana, R. (1987), The monotone circuit complexity of boolean functions, Combinatorica 7(1), 1-22.
2. Beame, P., Impagliazzo, R., Krajíček, J., Pitassi, T., Pudlák, P., and Woods, A. (1992), Exponential lower bounds for the pigeonhole principle, in "24th Annual ACM Symposium on Theory of Computing," pp. 200-220.
3. Beame, P., Karp, R., Pitassi, T., and Saks, M. (2002), The efficiency of resolution and Davis-Putnam procedures, SIAM Journal on Computing 31(4), 1048-1075.
4. Beame, P., and Pitassi, T. (1996), Simplified and improved resolution lower bounds, in "37th Annual IEEE Symposium on Foundations of Computer Science," pp. 274-282.
5. Ben-Sasson, E., and Wigderson, A. (2001). Short proofs are narrow: Resolution made simple, J. Assoc. Comput. Mach. 48(2), 149-169.
6. Bonet, M., Pitassi, T., and Raz, R. (1997), Lower bounds for cutting planes proofs with small coefficients, J. Symbolic Logic 62(3), 708-728.
7. Buss, S., and Pitassi, T. (1997), Resolution and the weak pigeonhole principle, in "11th International Workshop on Computer Science Logic," Lecture Notes in Computer Science, Vol. 1414, pp. 149-156, Springer-Verlag, Berlin.
8. Buss, S. R. (1987), Polynomial size proofs of the propositional pigeonhole principle, J. Symbolic Logic 52(4), 916-927.
9. Buss, S. R., and Turán, G. (1988), Resolution proofs on generalized pigeonhole principles, Theoret. Comput. Sci. 62(3), 311-317.
10. Chvátal, V., and Szemerédi, E. (1988), Many hard examples for resolution, J. Assoc. Comput. Mach. 35(4), 759-768.
11. Grimmet, G. R., and Stirzaker, D. R. (1982), "Probability and Random Processes," Oxford Science Publications, Oxford.
12. Haken, A. (1985), The intractability of resolution, Theoret. Comput. Sci. 39(2/3), 297-308.
13. Krajícek, J. (2002), On the weak pigeonhole principle, Fundamenta Mathematicæ 170(1-3), 123-140.
14. Maciel, A., Pitassi, T., and Woods, A. (2000), A new proof of the weak pigeonhole principle, in "32nd Annual ACM Symposium on Theory of Computing," pp. 368-377.
15. Paris, J. B., Wilkie, A. J., and Woods, A. R. (1988), Provability of the pigeonhole principle and the existence of infinitely many primes, J. Symbolic Logic 53(4), 1235-1244.
16. Pitassi, T., and Raz, R. (2001), Regular resolution lower bounds for the weak pigeonhole principle, in "33rd Annual ACM Symposium on Theory of Computing," pp. 347-355.
17. Pudlák, P. (1997), Lower bounds for resolution and cutting plane proofs and monotone computations, J. Symbolic Logic 62(3), 981-998.
18. Raz, R. (2002), Resolution lower bounds for the weak pigeonhole principle, "Electronic Colloquium on Computational Complexity," TR01-021. 34th Annual ACM Symposium on Theory of Computing, pp. 553-562.
19. Razborov, A. (2001), Improved resolution lower bounds for the weak pigeonhole principle, manuscript.