It is known that if an algebra of polymorphisms of the constraint langua...
For relational structures A, B of the same signature, the Promise Constr...
Let A be an idempotent algebra on a finite domain. By mediating between
...
This paper focuses on the algebraic theory underlying the study of the
c...
We prove that QCSP(ℕ;x=y→ y=z) is PSpace-complete,
settling a question o...
In 2007 it was conjectured that the Constraint Satisfaction Problem (CSP...
Surjective Constraint Satisfaction Problem (SCSP) is the problem of deci...
Surjective Constraint Satisfaction Problem (SCSP) is the problem of deci...
We give a surprising classification for the computational complexity of
...
We study the problem of whether a given finite clone generated by finite...
This paper investigates the computational complexity of deciding if a gi...
Constraint Satisfaction Problem on finite sets is known to be NP-complet...