The complexity of satisfiability problems: Refining Schaefer's theorem

Lecture Notes in Computer Science

Volumn 3618, Issue , 2005, Pages 71-82

  Allender, Eric ^a   Bauland, Michael ^b   Immerman, Neil ^c   Schnoor, Henning ^b   Vollmer, Heribert ^b  

^a RUTGERS UNIVERSITY   (United States)

^b LEIBNIZ UNIVERSITY HANNOVER   (Germany)

^c Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; CONSTRAINT THEORY; MATHEMATICAL PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

CONSTRAINT LANGUAGES; ISOMORPHISM; SCHAEFER'S THEOREM;

COMPUTATIONAL COMPLEXITY;

EID: 26844575981     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11549345_8     Document Type: Conference Paper

References (15)

1. [ABI97] E. Allender, J. Balcazar, and N. Immerman. A first-order isomorphism theorem. SIAM Journal on Computing, 26:557-567, 1997.
2. [AG00] C. Alvarez and R. Greenlaw. A compendium of problems complete for symmetric logarithmic space. Computational Complexity, 9(2):123-145, 2000.
3. [Agr01] M. Agrawal. The first-order isomorphism theorem. In Foundations of Software Technology and Theoretical Computer Science: 21st Conference, Bangalore, India, December 13-15, 2001. Proceedings, Lecture Notes in Computer Science, pages 58-69, Berlin Heidelberg, 2001. Springer Verlag.
4. [BCRV03] E. Böhler, N. Creignou, S. Reith, and H. Vollmer. Playing with Boolean blocks, part I: Post's lattice with applications to complexity theory. SIGACT News, 34(4):38-52, 2003.
5. [BCRV04] E. Böhler, N. Creignou, S. Reith, and H. Vollmer. Playing with Boolean blocks, part II: Constraint satisfaction problems. SIGACT News, 35(1):22-35, 2004.
6. [BRSV05] E. Böhler, S. Reith, H. Schnoor, and H. Vollmer. Simple bases for Boolean co-clones. Information Processing Letters, 2005. to appear.
7. [Bul02] A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proceedings 43rd Symposium on Foundations of Computer Science, pages 649-658. IEEE Computer Society Press, 2002.
8. [CKS01] N. Creignou, S. Khanna, and M. Sudan. Complexity Classifications of Boolean Constraint Satisfaction Problems. Monographs on Discrete Applied Mathematics. SIAM, 2001.
9. [Dal00] V. Dalmau. Computational complexity of problems over generalized formulas. PhD thesis, Department de Llenguatges i Sistemes Informàtica, Universitat Politécnica de Catalunya, 2000.
10. [JCG97] P. G. Jeavons, D. A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527-548, 1997.
11. [Pip97a] N. Pippenger. Pure versus impure Lisp. ACM Transactions on Programming Languages and Systems, 19:223-238, 1997.
12. [Pip97b] N. Pippenger. Theories of Computability. Cambridge University Press, Cambridge, 1997.
13. [Rei01] S. Reith. Generalized Satisfiability Problems. PhD thesis, Fachbereich Mathematik und Informatik, Universiät Würzburg, 2001.
14. [Rei05] Omer Reingold. Undirected st-connectivity in log-space. In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 376-385, New York, NY, USA, 2005. ACM Press.
15. [Sch78] T. J. Schaefer. The complexity of satisfiability problems. In Proceedings 10th Symposium on Theory of Computing, pages 216-226. ACM Press, 1978.