Abstract
A Constraint Satisfaction Problem (CSP) is a computational problem where we are given variables and constraints about them; the question is whether the variables can be assigned values such that all constraints are satisfied. We give an overview of the current state of research on CSPs where values for the variables and constraints are taken from a finitely bounded homogeneous structure which is fixed beforehand. We explain the main mathematical ideas so far, the three dilemmas they brought upon us, and what could be done to overcome them in order to obtain a satisfactory understanding of the computational complexity of such CSPs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.