Satisfiability, branch-width and Tseitin tautologies

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 593-603

  Alekhnovich, Michael ^a   Razborov, Alexander A ^b,c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c STEKLOV MATHEMATICAL INSTITUTE   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; AUTOMATA THEORY; BOUNDARY CONDITIONS; GRAPH THEORY; HEURISTIC METHODS; THEOREM PROVING;

BRANCHWIDTH; SATISFIABILITY; TSEITIN TAUTOLOGY; WIDTH BASED AUTOMATED THEOREM PROVER;

COMPUTATIONAL COMPLEXITY;

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

References (20)

1. M. Alekhnovich. Mutilated chessboard problem is exponentially hard for Resolution. Manuscript.
2. M. Alekhnovich, E. Ben-Sasson, A. Razborov, and A. Wigderson. Pseudorandom generators in propositional complexity. In Proceedings of the 41st IEEE FOCS, pages 43-53, 2000.
3. M. Alekhnovich and A. Razborov. Lower bounds for the polynomial calculus: non-binomial case. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pages 190-199, 2001.
4. M. Alekhnovich and A. Razborov. Resolution is not automatizable unless W[P] is tractable. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pages 210-219, 2001.
5. N. Alon and R. Boppana. The monotone circuit complexity of Boolean functions. Combinatorica, 7(1):1-22, 1987.
6. E. Amir and S. McIlraith. Solving Satisfiability using Decomposition and the Most Constrained Subproblem. LICS workshop on Theory and Applications of Satisfiability Testing (SAT 2001), 2001.
7. A. Atserias and M. Bonet. On the automatizability of resolution and related propositional proof systems. Technical Report TR02-010, Electronic Colloquium on Computational Complexity, 2002.
8. P. Beame and T. Pitassi. Simplified and improved resolution lower bounds. In Proceedings of the 37th IEEE FOCS, pages 274-282, 1996.
9. E. Ben-Sasson and R. Impagliazzo. Random CNF's are hard for the polynomial calculus. In Proceedings of the 40th IEEE FOCS, pages 415-421, 1999.
10. E. Ben-Sasson and A. Wigderson. Short proofs are narrow - resolution made simple. Journal of the ACM, 48(2):149-169, 2001.
11. H. L. Bodlaender. A Tourist Guide through Treewidth. Acta Cybernetica, 11:1-21, 1993.
12. M. Bonet and N. Galesi. A study of proof search algorithms for Resolution and Polynomial Calculus. In Proceedings of the 40th IEEE FOCS, pages 422-431, 1999.
13. M. Bonet, T. Pitassi, and R. Raz. On interpolation and automatization for Frege systems. SIAM Journal on Computing, 29(6):1939-1967, 2000.
14. J. Krajíček. Bounded arithmetic, propositional logic and complexity theory. Cambridge University Press, 1995.
15. S. Khanna and R. Motwani. Towards a syntactic characterization of PTAS. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 329-337, 1996.
16. R. Lipton and R. Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36: 177-189, 1979.
17. R. Lipton and R. Tarjan. Applications of a planar separator theorem. SIAM Journal on Computing, 9:615-627, 1980.
18. N. Robertson and P. D. Seymour. Graph Minors X. Obstructions to tree decomposition. Journal of Combinatorial Theory Series B, 52:153-190, 1991.
19. N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory Series B, 63:65-110, 1995.
20. G. C. Tseitin. On the complexity of derivations in propositional calculus. In Studies in constructive mathematics and mathematical logic, Part II. Consultants Bureau, New-York-London, 1968.