The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable

Given a fixed constraint language (varGamma ), the conservative CSP over (varGamma ) (denoted by c-CSP((varGamma ))) is a variant of CSP((varGamma )) where the domain of each variable can be restricted arbitrarily. In [5] a dichotomy has been proven for conservative CSP: for every fixed language (varGamma ), c-CSP((varGamma )) is either i...More