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

Journal of the ACM

Volumn 54, Issue 1, 2007, Pages

  Grohe, Martin ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Complexity; Conjunctive queries; Constraint satisfaction; Homomorphisms; Parameterized complexity

Indexed keywords

CONSTRAINT THEORY; DATABASE SYSTEMS; GRAPH THEORY; PROBLEM SOLVING; QUERY LANGUAGES; TREES (MATHEMATICS);

CONJUNCTIVE QUERIES; CONSTRAINT SATISFACTION; HOMOMORPHISMS; PARAMETERIZED COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 33947240907     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1206035.1206036     Document Type: Article

References (36)

1. ABITEBOUL, S., HULL, R., AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Reading, MA.
2. ABRAHAMSON, K., DOWNEY, R., AND FELLOWS, M. 1995. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs. Arm. Pure Appl. Logic 73, 235-276.
3. ADLER, I., GOTTLOB, G., AND GROHE, M. 2005. Hypertree-width and related hypergraph invariants. In Proceedings of the 3rd European Conference on Combinatorics, Graph Theory, and Applications, S. Felsner, Ed. DMTCS Proceedings Series, vol. AE. 5-10.
4. BULATOV, A. 2002. A dichotomy theorem for constraints on a three-element set. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 649-658.
5. BULATOV, A. 2003. Tractable conservative constraint satisfaction problems. In Proceedings of the 18th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 321-330.
6. BULATOV, A., KROKHIN, A., AND JEAVONS, P. 2001. The complexity of maximal constraint languages. In Proceedings of the 33rd ACM Symposium on Theory of Computing. ACM, New York, 667-674.
7. CHANDRA, A., AND MERLIN, P. 1977. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of the 9th ACM Symposium on Theory of Computing. ACM, New York, 77-90.
8. CHEKURI, C., AND RAJARAMAN, A. 1997. Conjunctive query containment revisited. In Proceedings of the 5th International Conference on Database Theory, P. Kolaitis and F. Afrati, Eds. Lecture Notes in Computer Science, vol. 1186. Springer-Verlag, New York, 56-70.
9. CHEN, H., AND DALMAU, V. 2005. Beyond hypertree width: Decomposition methods without decompositions. In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, P. van Beek, Ed. Lecture Notes in Computer Science, vol. 3709. Springer-Verlag, New York, 167-181.
10. COHEN, D., JEAVONS, P., AND GYSSENS, M. 2005. A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, L. P. Kaelbling and A. Saffiotti, Eds. 72-77.
11. DALMAU, V. 2005. Generalized majority-minority operations are tractable. In Proceedings of the 20th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 438-147.
12. DALMAU, V., AND JONSSON, P. 2004. The complexity of counting homomorphisms seen from the other side. Theoret. Comput. Sci. 329, 315-323.
13. DALMAU, V., KOLAITIS, P. G., AND VARDI, M. Y. 2002. Constraint satisfaction, bounded treewidth, and finite-variable logics. In Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, P. V. Hentenryck, Ed. Lecture Notes in Computer Science, vol. 2470. Springer-Verlag, New York, 310-326.
14. DOWNEY, R., AND FELLOWS, M. 1995a. Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24, 873-921.
15. DOWNEY, R., AND FELLOWS, M. 1995b. Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoret. Comput. Sci. 141, 109-131.
16. DOWNEY, R., AND FELLOWS, M. 1999. Parameterized Complexity. Springer-Verlag, New York.
17. FEDER, T., AND VARDI, M. 1998. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM J. Comput. 28, 57-104.
18. FLUM, J., FRICK, M., AND GROHE, M. 2002. Query evaluation via tree-decompositions. J. ACM 49, 6, 716-752.
19. FLUM, J., AND GROHE, M. 2006. Parameterized Complexity Theory. Springer-Verlag, New York.
20. FREUDER, E. 1990. Complexity of k-tree structured constraint satisfaction problems. In Proceedings of the 8th National Conference on Artificial Intelligence. 4-9.
21. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 2002. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci. 64, 579-627.
22. GOTTLOB, G., LEONE, N., AND SCARCELLO, F. 2003. Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. J. Comput. Syst. Sci. 66, 775-808.
23. GROHE, M. 2003. The complexity of homomorphism and constraint satisfaction problems seen from the other side. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 552-561.
24. GROHE, M., AND MARX, D. 2006. Constraint solving via fractional edge covers. In Proceedings of the of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 289-298.
25. GROHE, M., SCHWENTICK, T., AND SEGOUFIN, L. 2001. When is the evaluation of conjunctive queries tractable. In Proceedings of the 33rd ACM Symposium on Theory of Computing. ACM, New York, 657-666.
26. HELL, P., AND NEŠETŘIL, J. 1990. On the complexity of H-coloring. J. Combinat. Theory, Ser. B 48, 92-110.
27. HELL, P., AND NEŠETŘIL, J. 1992. The core of a graph. Disc. Math. 109,117-126.
28. KOLAITIS, P. AND VARDI, M. 1995. On the expressive power of datalog: tools and a case study. J. Comput. Syst. Sci. 51, 1, 110-134.
29. KOLAITIS, P., AND VARDI, M. 1998. Conjunctive-query containment and constraint satisfaction. In Proceedings of the 17th ACM Symposium on Principles of Database Systems. ACM, New York, 205-213.
30. PAPADMITRIOU, C. H., AND YANNAKAKIS, M. 1993. On limited nondeterminism and the complexity of the VC-dimension. In Proceedings of the 25th ACM Symposium on Theory of Computing. ACM, New York, 12-18.
31. PLEHN, J., AND VOIGT, B. 1990. Finding minimally weighted subgraphs. In Graph-Theoretic Concepts in Computer Science, WG' 90, R. Mohring, Ed. Lecture Notes in Computer Science, vol. 484. Springer-Verlag, New York, 18-29.
32. REED, B. 1997. Tree width and tangles: A new connectivity measure and some applications. In Surveys in Combinatorics, R. Bailey, Ed. LMS Lecture Note Series, vol. 241. Cambridge University Press, Cambridge, MA. 87-162.
33. ROBERTSON, N., AND SEYMOUR, P. 1986. Graph minors V. Excluding a planar graph. J. Combinat. Theory, Ser. 841, 92-114.
34. ROBERTSON, N., AND SEYMOUR, P. 1995. Graph minors XII. Distance on a surface. J. Combinat. Theory, Ser. B 64, 240-272.
35. ROBERTSON, N., SEYMOUR, P., AND THOMAS, R. 1994. Quickly excluding a planar graph. J. Combinat. Theory, Ser. B 62, 323-348.
36. VARDI, M. 2000. Constraint satisfaction and database theory: A tutorial. In Proceedings of the 19th ACM Symposium on Principles of Database Systems. ACM, New York, 76-85.