Dichotomies for classes of homomorphism problems involving unary functions

  title={Dichotomies for classes of homomorphism problems involving unary functions},
  author={Tom{\'a}s Feder and Florent R. Madelaine and Iain A. Stewart},
  journal={Theor. Comput. Sci.},
We study non-uniform constraint satisfaction problems where the underlying signature contains constant and function symbols as well as relation symbols. Amongst our results are the following. We establish a dichotomy result for the class of non-uniform constraint satisfaction problems over the signature consisting of one unary function symbol by showing that every such problem is either complete for L, via very restricted logical reductions, or trivial (depending upon whether the template… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 18 references

The complexity of satisfiability problems

T. J. Schaefer
Proceedings of 10th ACM Symposium on Theory of Computing • 1978
View 20 Excerpts
Highly Influenced

On the complexity of H-coloring

J. Comb. Theory, Ser. B • 1990
View 7 Excerpts
Highly Influenced

Descriptive Complexity

Graduate Texts in Computer Science • 1999
View 1 Excerpt

Constraints and universal algebra

Annals of Mathematics and Artificial Intelligence • 1998
View 1 Excerpt

Similar Papers

Loading similar papers…