Dichotomies for classes of homomorphism problems involving unary functions

Theoretical Computer Science

Volumn 314, Issue 1-2, 2004, Pages 1-43

  Feder, Tomás ^a   Madelaine, Florent ^b   Stewart, Iain A ^c  

^a Univ de La Réunion ^*  (United States)

^b UNIVERSITÉ DE LA RÉUNION   (France)

^c DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; FUNCTIONS; NUMERICAL ANALYSIS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

HOMOMORPHISM PROBLEMS; UNARY FUNCTIONS;

COMPUTER SCIENCE;

EID: 0842329854     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.12.015     Document Type: Article

References (23)

1. Bulatov A.A., Krokhin A.A., Jeavons P. Constraint satisfaction problems and finite algebras. Montanari U., Rolim J.D.P., Welzl E. Proc. 27th Internat. Colloquium on Automata, Languages and Programming, ICALP'00. Lecture Notes in Computer Science. Vol. 1853:2000;272-282 Springer, Berlin.
2. A.K. Chandra, P.M. Merlin, Optimal implementation of conjunctive queries in relational databases, Proc. 9th ACM Symp. on Theory of Computing (1977) 77-90.
3. J. Diaz, M. Serna, D.M. Thilikos, The complexity of restrictive H -coloring, in: L. Kucera (Ed.), Proc. 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'02, Lecture Notes in Computer Science, Vol. 2573, Springer, Berlin, 2002, pp. 126-137.
4. Dukes P., Emerson H., MacGillivray G. Undecidable generalized colouring problems. J. Combinat. Math. Combinat. Comput. 28:1998;97-112.
5. Dyer M., Greenhill C. The complexity of counting graph homomorphisms. Random Struct. Algorithms. 17:2000;260-289.
6. Feder T. Classification of homomorphisms to oriented cycles and of. k -partite satisfiability SIAM J. Discrete Math. 14:2001;471-480.
7. Feder T., Hell P. List homomorphisms to reflexive graphs. J. Combinat. Theory (Ser. B). 72:1998;236-250.
8. Feder T., Hell P., Huang J. List homomorphisms and circular-arc graphs. Combinatorica. 19:1999;487-505.
9. Feder T., Hell P., Huang J. Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory. 42:1999;61-80.
10. Feder T., Vardi M. The computational structure of monotone monadic SNP and constraint satisfaction. a study through Datalog and group theory SIAM J. Comput. 28:1998;57-104.
11. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
12. Gutjahr W., Welzl E., Woeginger G. Polynomial graph colourings. Discrete Appl. Math. 35:1992;29-45.
13. Hell P., Nešetřil J. On the complexity of. H -colouring J. Combinat. Theory (Ser. B). 48:1990;92-110.
14. Immerman N., Landau S. The complexity of iterated multiplication. Inform. Comput. 116:1995;103-116.
15. Immerman N. Descriptive Complexity. 1998;Springer, Berlin.
16. Jeavons P.G., Cohen D.A., Pearson J.K. Constraints and universal algebra. Ann. Math. Artif. Intell. 24:1998;51-67.
17. P.G. Kolaitis, M.Y. Vardi, Conjunctive-query containment and constraint satisfaction, Proc. 17th ACM Symp. on Principles of Database Systems, 1998, pp. 205-213.
18. Papadimitriou C.H. Computational Complexity. 1994;Addison Wesley, Reading, MA.
19. Puricella A., Stewart I.A. A generic greedy algorithm, partially-ordered graphs and NP-completeness. Brandstaedt A., Le V.B. Proc. 27th Internat. Workshop on Graph-Theoretic Concepts in Computer Science, WG'01. Lecture Notes in Computer Science. Vol. 2204:2001;306-316 Springer, Berlin.
20. Puricella A., Stewart I.A. Greedy algorithms, H -colourings and a complexity-theoretic dichotomy Theoret. Comput. Sci. 290:2003;1897-1913.
21. T.J. Schaefer, The complexity of satisfiability problems, Proc. 10th ACM Symp. on Theory of Computing, 1978, pp. 216-226.
22. Stewart I.A. Completeness of path-problems via logical reductions. Inform. Comput. 121:1995;123-134.
23. Tsang E.P.K. Foundations of Constraint Satisfaction. 1993;Academic Press, New York.