A switching lemma for small restrictions and lower bounds for k-DNF resolution

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 604-613

  Segerlind, Nathan ^a   Buss, Sam ^a   Impagliazzo, Russell ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; BOUNDARY CONDITIONS; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; GRAPH THEORY; LOGIC CIRCUITS; THEOREM PROVING;

LOWER BOUNDS; PROPOSITIONAL PROOF SYSTEM; RESTRICTIONS; SWITCHING LEMMA; WEAK PIGEONHOLE PRINCIPLE;

SWITCHING THEORY;

EID: 0036957932     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. 1-formulae in finite structures. Annals of Pure and Applied Logic, 24: 1-48, 1983.
2. A. Atserias and M. L. Bonet. On the automatizability of resolution and related propositional proof systems. In Electronic Colloquium on Computational Complexity, technical reports, 2002.
3. A. Atserias, M. L. Bonet, and J. L. Esteban. Lower bounds for the weak pigeonhole principle beyond resolution. Lecture Notes in Computer Science, 2076, 2001.
4. P. Beame. A switching lemma primer. Technical report, Department of Computer Science and Engineering, University of Washington, 1994.
5. P. Beame, R. Karp, T. Pitassi, and M. Saks. On the complexity of unsatisfiability proofs for random k-CNF formulas. In ACM Symposium on Theory of Computing (STOC), 1998.
6. P. Beame and T. Pitassi. Simplified and improved resolution lower bounds. In 37th Annual Symposium on Foundations of Computer Science, pages 274-282. IEEE, 1996.
7. P. Beame and T. Pitassi. Propositional proof complexity: Past, present, and future. Bulletin of the EATCS, 65:66-89, 1998.
8. E. Ben-Sasson. Hard examples for bounded depth frege. In ACM Symposium on Theory of Computing (STOC), 2002.
9. E. Ben-Sasson and A. Wigderson. Short proofs are narrow - resolution made simple. Journal of the ACM, 48(2):149-169, 2001.
10. M. L. Bonet and N. Galesi. A study of proof search algorithms for resolution and polynomial calculus. In 40th Annual Symposium on Foundations of Computer Science, pages 422-431. IEEE Computer Society Press, 1999.
11. R. Boppana and M. Sipser. The complexity of finite functions. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A. Elsevier and MIT Press, 1990.
12. S. R. Buss and G. Turán. Resolution proofs of generalized pigeonhole principles. Theoretical Computer Science, 62(3):311-317, December 1988.
13. L. Cai, J. Chen, and J. Håstad. Circuit bottom fan-in and computational power. SIAM Journal on Computing, 27(2):341-355, March 1998.
14. V. Chvátal and E. Szemerédi. Many hard examples for resolution. Journal of the ACM, 35(4): 759-768, October 1988.
15. S. Cook and R. Reckhow. The relative efficiency of propositional proof systems. The Journal of Symbolic Logic, 44(1):36-50, March 1979.
16. S. Dantchev and S. Riis. Tree resolution proofs of the weak pigeon-hole principle. In Annual Conference on Structure in Complexity Theory, 2001.
17. J. L. Esteban, N. Galesi, and J. Messner. On the complexity of resolution with bounded conjunctions. In 29th International Colloquium on Automata, Languages and Programming, 2002.
18. M. Furst, J. Saxe, and M. Sipser. Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory, 17(1):13-27, April 1984.
19. A. Goerdt. Unrestricted resolution versus N-resolution. In Mathematical Foundations of Computer Science 1990, volume 452 of Lecture Notes in Computer Science, pages 300-305. Springer, 1990.
20. A. Haken. The instractability of resolution. Theoretical Computer Science, 39(2-3):297-308, August 1985.
21. J. Håstad. Almost optimal lower bounds for small depth circuits. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing (STOC), pages 6-20, 1986.
22. J. Håstad. Almost optimal lower bounds for small depth circuits. ADVCR: Advances in Computing Research, 5, 1989.
23. J. Krajíček. Bounded Arithmetic, Propositional Logic and Complexity Theory. Cambridge University Press, 1995.
24. J. Krajíček. On the weak pigeonhole principle. Fudamenta Mathematicae, 170:123-140, 2001.
25. A. Maciel, T. Pitassi, and A. Woods. A new proof of the weak pigeonhole principle. In ACM Symposium on Theory of Computing (STOC), 2000.
26. T. Pitassi and R. Raz. Regular resolution lower bounds for the weak pigeonhole principle. In ACM Symposium on Theory of Computing (STOC), 2001.
27. P. Pudlák. The lengths of proofs. In S. R. Buss, editor, Handbook of Proof Theory, pages 547-637. Elsevier North-Holland, 1998.
28. R. Raz. Resolution lower bounds for the weak pigeonhole principle. In Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing (STOC), 2002.
29. A. Razborov. Improved resolution lower bounds for the weak pigeonhole principle. In Electronic Colloquium on Computational Complexity, technical reports, 2001.
30. M. Sipser. Borel sets and circuit complexity. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC), pages 61-69, 1983.
31. G. Tseitin. On the complexity of proofs in propositional logics. Seminars in Mathematics, 8, 1970.
32. A. Urquhart. Hard examples for resolution. Journal of the ACM, 34(1):209-219, 1987.