On the relative complexity of resolution refinements and cutting planes proof systems

SIAM Journal on Computing

Volumn 30, Issue 5, 2000, Pages 1462-1484

  Bonet, Maria Luisa ^a   Esteban, Juan Luis ^a   Galesi, Nicola ^a   Johannsen, Jan ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF MUNICH   (Germany)

Author keywords

Circuit complexity; Computational complexity; Cutting planes proof system; Proof complexity; Resolution

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; POLYNOMIALS; THEOREM PROVING; TREES (MATHEMATICS);

CUTTING PLANES PROOF SYSTEMS; RELATIVE COMPLEXITY; RESOLUTION REFINEMENTS;

COMPUTATIONAL COMPLEXITY;

EID: 0035178618     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799352474     Document Type: Article

References (33)

1. P. BEAME, R. KARP, T. PITASSI, AND M. SAKS, The efficiency of resolution and Davis-Putnam procedures, submitted, 1999.
2. P. BEAME AND T. PITASSI, Simplified and improved resolution lower bounds, in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1996, pp. 274-282.
3. E. BEN-SASSON AND A. WIGDERSON, Short proofs are narrow - resolution made simple, in Proceedings of the 31st ACM Symposium on Theory of Computing, Atlanta, GA, 1999, pp. 517-526.
4. E. BEN-SASSON, R. IMPAGLIAZZO, AND A. WIGDERSON, Near-Optimal Separation of Treelike and General Resolution, Electronic Colloquium on Computational Complexity TR 00-005, http://www.eccc.uni-trier.de/eccc-local/Lists/TR-2000.html.
5. M. L. BONET, J. L. ESTEBAN, N. GALESI, AND J. JOHANNSEN, Exponential separations between restricted resolution and cutting planes proof systems, in Proceedings of the 39th Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1998, pp. 638-647.
6. M. L. BONET, T. PITASSI, AND R. RAZ, Lower bounds for cutting planes proofs with small coefficients, J. Symbolic Logic, 62 (1997), pp. 708-728.
7. Preliminary version in Proceedings of the 27th ACM Symposium on Theory of Computing, Las Vegas, NV, 1995, pp. 575-584.
8. V. CHVÁTAL AND E. SZEMERÉDI, Many hard examples for resolution, J. ACM, 35 (1988), pp. 759-768.
9. P. CLOTE AND A. SETZER, On PHP, st-connectivity and odd charged graphs, in Proof Complexity and Feasible Arithmetics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 39, P. Beame and S. R. Buss, eds., AMS, Providence, RI, 1998, pp. 93-117.
10. S. COOK AND A. HAKEN, An exponential lower bound for the size of monotone real circuits, J. Comput. System Sci., 58 (1999), pp. 326-335.
11. S. A. COOK AND R. A. RECKHOW, The relative efficiency of propositional proof systems, J. Symbolic Logic, 44 (1979), pp. 36-50.
12. W. COOK, C. COULLARD, AND G. TURÁN, On the complexity of cutting plane proofs, Discrete Appl. Math., 18 (1987), pp. 25-38.
13. X. FU, Lower bounds on sizes of cutting planes proofs for modular coloring principles, in Proof Complexity and Feasible Arithmetics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 39, P. Beame and S. R. Buss, eds., AMS, Providence, RI, 1998, pp. 135-148.
14. A. GOERDT, Davis-Putnam resolution versus unrestricted resolution, Ann. Math. Artificial Intelligence, 6 (1992), pp. 169-184.
15. A. GOERDT, Unrestricted resolution versus N-resolution, Theoret. Comput. Sci., 93 (1992), pp. 159-167.
16. A. GOERDT, Regular resolution versus unrestricted resolution, SIAM J. Comput., 22 (1993), pp. 661-683.
17. A. HAKEN, The intractability of resolution, Theoret. Comput. Sci., 39 (1985), pp. 297-308.
18. R. IMPAGLIAZZO, T. PITASSI, AND A. URQUHART, Upper and lower bounds for tree-like cutting planes proofs, in Proceedings of the 9th IEEE Symposium on Logic in Computer Science, IEEE Computer Society, Los Alamitos, CA, 1994, pp. 220-228.
19. J. JOHANNSEN, Lower bounds for monotone real circuit depth and formula size and tree-like cutting planes, Inform. Process Lett., 67 (1998), pp. 37-41.
20. S. JUKNA, Combinatorics of monotone computations, Combinatorica, 19 (1999), pp. 65-85.
21. Preliminary version available as Electronic Colloquium on Computational Complexity TR98-041, 1998, http://www.eccc.uni-trier.de/eccc-local/Lists/TR-1999.html.
22. M. KARCHMER AND A. WIGDERSON, Monotone circuits for connectivity require super-logarithmic depth, SIAM J. Discrete Math., 3 (1990), pp. 255-265.
23. Preliminary version in Proceedings of the 20th ACM Symposium on Theory of Computing, Chicago, IL, 1988, pp. 539-550.
24. J. KRAJÍČEK, Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic, J. Symbolic Logic, 62 (1997), pp. 457-486.
25. J. KRAJÍČEK, Interpolation by a game, MLQ Math. Log. Q., 44 (1998), pp. 450-458.
26. P. PUDLÁK, Lower bounds for resolution and cutting plane proofs and monotone computations, J. Symbolic Logic, 62 (1997), pp. 981-998.
27. P. PUDLÁK AND R. IMPAGLIAZZO, A lower bound for DLL algorithms for k-SAT, in Proceedings of the ACM Symposium on Discrete Algorithms, ACM, New York, 2000, pp. 128-136.
28. R. RAZ AND P. MCKENZIE, Separation of the monotone NC hierarchy, Combinatorica, 19 (1999), pp. 403-435.
29. Preliminary version in Proceedings of the 38th Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1997, pp. 234-243.
30. A. ROSENBLOOM, Monotone real circuits are more powerful than monotone boolean circuits, Inform. Process Lett., 61 (1997), pp. 161-164.
31. U. SCHÖNING, Logic for Computer Scientists, Birkhäuser, Basel, 1989.
32. A. URQUHART, Hard examples for resolution, J. ACM, 34 (1987), pp. 209-219.
33. A. URQUHART, The complexity of propositional proofs, Bull. Symbolic Logic, 1 (1995), pp. 425-467.