Constraint Satisfaction with Weakly Oligomorphic Template
Christian Pech, Maja Pech · 2011
Constraint satisfaction problems form a very interesting and much studied class of decision problems. Feder and Vardi realized their relation to general coloring problems of relational structure. This enabled the use of algebraic, combinatorial, and model theoretic methods for studying the complexity of such decision problems. In this paper we are interested in constraint satisfaction problems with countable homomorphism homogeneous template and, more generally, with weakly oligomorphic templates. A ).