The complexity of homomorphism and constraint satisfaction problems seen from the other side

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2003-January, Issue , 2003, Pages 552-561

  Grohe, M ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Artificial intelligence; Complexity theory; Computational complexity; Computer science; Constraint theory; Dynamic programming; NP complete problem; Polynomials; Relational databases; Tree graphs

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; COMPUTER SCIENCE; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; FIBER OPTICS; FORESTRY; POLYNOMIAL APPROXIMATION; POLYNOMIALS; TREES (MATHEMATICS);

COMPLEXITY THEORY; PARAMETERIZED COMPLEXITY; POLYNOMIAL-TIME; RELATIONAL DATABASE; RELATIONAL STRUCTURES; SIDE STRUCTURE; TREE GRAPH; TREE-WIDTH;

C (PROGRAMMING LANGUAGE);

EID: 3142749433     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238228     Document Type: Conference Paper

References (28)

1. K.A. Abrahamson, R.G. Downey, and M.R. Fellows. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs. Annals of pure and applied logic, 73:235-276, 1995.
2. A. A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pages 649-658, 2002.
3. A. A. Bulatov, A. A. Krokhin, and P. Jeavons. Constraint satisfaction problems and finite algebras. In U. Montanari, J. D. P. Rolim, and E. Welzl, editors, Proceedings of the 27th International Colloquium on Automata, Languages and Programming, volume 1853 of Lecture Notes in Computer Science, pages 272-282. Springer-Verlag, 2000.
4. A. A. Bulatov, A. A. Krokhin, and P. Jeavons. The complexity of maximal constraint languages. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 667-674, 2001.
5. A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of the 9th ACM Symposium on Theory of Computing, pages 77-90, 1977.
6. Ch. Chekuri and A. Rajaraman. Conjunctive query containment revisited. In Ph. Kolaitis and F. Afrati, editors, Proceedings of the 5th International Conference on Database Theory, volume 1186 of Lecture Notes in Computer Science, pages 56-70. Springer-Verlag, 1997.
7. V. Dalmau, Ph. G. Kolaitis, and M. Y. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics. In P. Van Hentenryck, editor, Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, volume 2470 of Lecture Notes in Computer Science, pages 310-326. Springer-Verlag, 2002.
8. R.G. Downey and M.R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing, 24:873-921, 1995.
9. R.G. Downey and M.R. Fellows. Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science, 141:109-131, 1995.
10. R.G. Downey and M.R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
11. T. Feder and M.Y. Vardi. The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory. SIAM Journal on Computing, 28:57-104, 1998.
12. J. Flum, M. Frick, and M. Grohe. Query evaluation via tree-decompositions. Journal of the ACM, 49(6):716-752, 2002.
13. J. Flum and M. Grohe. Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing, 31(1):113-145, 2001.
14. E.C Freuder. Complexity of k-tree structured constraint satisfaction problems. In Proc. AAAI-90, pages 4-9, 1990.
15. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. In T. Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 394-399. Morgan Kaufmann, 1999.
16. G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. In Proceedings of the 18th ACM Symposium on Principles of Database Systems, pages 21-32, 1999.
17. M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 657-666, 2001.
18. P. Hell and J. Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory, Series B, 48:92-110, 1990.
19. P. Hell and J. Nešetřil. The core of a graph. Discrete Mathematics, 109:117-126, 1992.
20. P. Jeavons, D. A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527-548, 1997.
21. Ph.G. Kolaitis and M.Y. Vardi. On the expressive power of datalog: tools and a case study. Journal of Computer and System Sciences, 51(1):110-134, 1995.
22. Ph.G. Kolaitis and M.Y. Vardi. Conjunctive-query containment and constraint satisfaction. In Proceedings of the 17th ACM Symposium on Principles of Database Systems, pages 205-213, 1998.
23. C. H. Papadimitriou and M. Yannakakis. On limited nondeterminism and the complexity of the VC-dimension. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 12-18, 1993.
24. J. Plehn and B. Voigt. Finding minimally weighted subgraphs. In R. Möhring, editor, Graph-Theoretic Concepts in Computer Science, WG '90, volume 484 of Lecture Notes in Computer Science, pages 18-29. Springer-Verlag, 1990.
25. N. Robertson and P.D. Seymour. Graph minors V. Excluding a planar graph. Journal of Combinatorial Theory, Series B, 41:92-114, 1986.
26. N. Robertson, P.D. Seymour, and R. Thomas. Quickly excluding a planar graph. Journal of Combinatorial Theory, Series B, 62:323-348, 1994.
27. T.J. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th ACM Symposium on Theory of Computing, pages 216-226, 1978.
28. M. Yannakakis. Algorithms for acyclic database schemes. In 7th International Conference on Very Large Data Bases, pages 82-94, 1981.