It is shown that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and how the computational complexity of the corresponding constraint satisfaction problem is connected to the properties of this algebra is explored.
The Dichotomy Conjecture for the non-uniform CSP states that for every constraint language \Gm the problem CSP is either solvable in polynomial time or is NP-complete.
This work completely characterize conservative constraint languages that give rise to polynomial time solvable CSP classes, and obtains a complete description of those (directed) graphs H for which the List H-Coloring problem is solvable in polynometric time.
18th Annual IEEE Symposium of Logic in Computer…
22 June 2003
TLDR
This work completely characterize conservative constraint languages that give rise to CSP classes solvable in polynomial time, and obtains a complete description of those (directed) graphs H for which the List H-Coloring problem is poynomial time solvable.
It is shown that any restricted set of constraint types can be associated with a finite universal algebra and the result is a dichotomy theorem which significantly generalises Schaefer's dichotomy for the Generalised Satisfiability problem.
A different and much simpler algorithm for this type of constraint satisfaction problem, which includes the affine satisfiability problem, subgroup and near subgroup constraints, and many others.
This article characterize relational structures H for which (#CSP(H) can be solved in polynomial time and prove that for all other structures the problem is #P-complete.
The 43rd Annual IEEE Symposium on Foundations of…
16 November 2002
TLDR
Every subclass of the CSP defined by a set of allowed constraints is either tractable or NP-complete, and the criterion separating them is that conjectured by Bulatov et al. (2001).