Constraint satisfaction with countable homogeneous templates

Abstract

For a fixed countable homogeneous relational structure $\Gamma$ we study the computational problem whether a given finite structure of the same signature homomorphically maps to $\Gamma$.

Keywords

• Constraint
• satisfaction
• countable
• homogeneous
• templates