Near optimal separation of tree-like and general resolution

Combinatorica

Volumn 24, Issue 4, 2004, Pages 585-603

  Ben Sasson, Eli ^a,b   Impagliazzo, Russell ^e   Wigderson, Avi ^c,d  

^a HARVARD UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

^d HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 16244414631     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-004-0036-5     Document Type: Article

References (33)

1. R. AHARONI and N. LINIAL: Minimal Non-Two-Colorable Hypergraphs and Minimal Unsatisfiable Formulas, J. of Combinatorial Theory, Series A 43(2) (1986), 196-204.
2. M. L. BONET, J. L. ESTEBAN, N. GALESI and J. JOHANNSEN: Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems, in 39th Symposium on Foundations of Computer Science (FOCS 1998) pp. 638-647.
3. P. BEAME, R. KARP, T. PITASSI and M. SAKS: On the Complexity of Unsatisfiability Proofs for Random Κk-CNF Formulas, Preliminary version in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 561-571, Dallas, TX, May 1998. Final version in SIAM Journal on Computing 31(4) (2002), 1048-1075.
4. P. BEAME, R. KARP, T. PITASSI and M. SAKS: On the Complexity of Unsatisfiability Proofs for Random Κk-CNF Formulas, Preliminary version in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 561-571, Dallas, TX, May 1998. Final version in SIAM Journal on Computing 31(4) (2002), 1048-1075.
5. P. BEAME and T. PITASSI: Simplified and Improved resolution lower bounds, Preliminary version in 37th Annual Symposium on Foundations of Computer Science, pp. 274-282, Burlington, VT, October 1996, IEEE. Final version in SIAM Journal on Computing 31(4) (2002), 1048-1075.
6. P. BEAME and T. PITASSI: Simplified and Improved resolution lower bounds, Preliminary version in 37th Annual Symposium on Foundations of Computer Science, pp. 274-282, Burlington, VT, October 1996, IEEE. Final version in SIAM Journal on Computing 31(4) (2002), 1048-1075.
7. S. Buss and T. PITASSI: Resolution and the Weak Pigeonhole Principle, in Springer-Verlag Lecture Notes in Computer Science. (Publications of selected papers presented at Proceedings from Computer Science Logic '97).
8. S. R. Buss and GY. TURÁN: Resolution Proof of generalized Pigeonhole principles, Theoretical Comp. Sci. 62(3) (1988), 311-317.
9. E. BEN-SASSON and A. WIGDERSON: Short Proofs are Narrow - Resolution made Simple, Journal of the ACM 48(2) (2001), 149-169. Preliminary version in STOC99.
10. E. BEN-SASSON and A. WIGDERSON: Short Proofs are Narrow - Resolution made Simple, Journal of the ACM 48(2) (2001), 149-169. Preliminary version in STOC99.
11. S. A. COOK: An Observation on Time-Storage Trade-Off, J. of Comp. and Sys. Sci. 9 (1974), 308-316.
12. M. CLEGG, J. EDMONDS and R. IMPAGLIAZZO: Using the Groebner Basis algorithm to find proofs of unsatisfiability, In Proceedings of the 28th ACM symposium on Theory of Computing, 1996, pp. 174-183.
13. J. R. CELONI, W. J. PAUL and R. E. TARJAN: Space Bounds for a Game on Graphs, Math. Systems Theory 10 (1977), 239-251.
14. S. A. COOK and R. RECKHOW: The relative efficiency of propositional proof systems, J. of Symbolic Logic 44 (1979), 36-50.
15. V. CHVÁTAL and E. SZEMERÉDI: Many Hard Examples for Resolution, J. of the ACM 35(4) (1988), 759-768.
16. M. DAVIS, G. LOGEMANN and D. LOVELAND: A Machine program for theorem proving, Communications of the ACM 5 (1962), 394-397.
17. A. HAKEN: The Intractability of Resolution, Theoretical Computer Science 39 (1985), 297-308.
18. J. E. HOPCROFT, W. PAUL and L. VALIANT: On Time vs. Space, J. of the ACM 24 (1977), 332-337.
19. R. IMPAGLIAZZO, P. PUDLÁK and J. SGALL: Lower Bounds for the Polynomial-Calculus and the Groebner Basis Algorithm, Computational Complexity 8(2) (1999), 127-144. Electronically at Electronic Colloquium on Computational Complexity Reports Series 1997, Available at http://www.eccc.uni-trier.de/eccc/, Technical Report TR97-042.
20. R. IMPAGLIAZZO, P. PUDLÁK and J. SGALL: Lower Bounds for the Polynomial-Calculus and the Groebner Basis Algorithm, Computational Complexity 8(2) (1999), 127-144. Electronically at Electronic Colloquium on Computational Complexity Reports Series 1997, Available at http://www.eccc.uni-trier.de/eccc/, Technical Report TR97-042.
21. R. RAZ and P. McKENZIE: Separation of the Monotone NC Hierarchy, Combinatorica 19(3) (1999), 403-435. Preliminary version in Proceedings of the 38th FOCS 1997, pp. 234-243.
22. R. RAZ and P. McKENZIE: Separation of the Monotone NC Hierarchy, Combinatorica 19(3) (1999), 403-435. Preliminary version in Proceedings of the 38th FOCS 1997, pp. 234-243.
23. N. PIPPENGER: Pebbling, Technical Report, IBM Watson Research Center.
24. P. PUDLÁK and R. IMPAGLIAZZO: Lower bounds for DLL algorithms for Κk-SAT, Proceedings of SODA 2000, pp. 128-136.
25. A. A. RAZBOROV: Unprovability of Lower Bounds on Circuit Size in Certain Fragments of Bounded Arithmetic, Izvestia of the RAN 59(1) (1995), 201-222.
26. A. A. RAZBOROV: Lower Bounds for the Polynomial Calculus, Computational Complexity 7(4) (1998), 291-324.
27. A. A. RAZBOROV and S. RUDICH: Natural Proofs, Journal of Computer and System Sciences 55(1) (1997), 24-35. Preliminary version in Proc. of the 26th STOC 1994, pp. 204-213.
28. A. A. RAZBOROV and S. RUDICH: Natural Proofs, Journal of Computer and System Sciences 55(1) (1997), 24-35. Preliminary version in Proc. of the 26th STOC 1994, pp. 204-213.
29. A. A. RAZBOROV, A. WIGDERSON and A. YAO: Read-Once Branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus, Proc. of the 29th STOC 1997, pp. 739-748.
30. B. SELMAN: personal communication, 1995.
31. G. S. TSEITIN: On the Complexity of Derivation in Propositional Calculus, in Studies in Constructive Mathematics and Mathematical Logic, Part 2, Consultants Bureau, New-York-London, 1968, pp. 115-125.
32. A. URQUHART: Hard Examples for Resolution, J. of the ACM 34(1) (1987), 209-219.
33. A. URQUHART: The Complexity of Prepositional Proofs, The Bulletin of Symbolic Logic 1(4) (1995), 425-467.