2000 character limit reached
A modification of the CSP algorithm for infinite languages (1803.07465v2)
Published 17 Mar 2018 in cs.CC
Abstract: Constraint Satisfaction Problem on finite sets is known to be NP-complete in general but certain restrictions on the constraint language can ensure tractability. It was proved that if a constraint language has a weak near unanimity polymorphism then the corresponding constraint satisfaction problem is tractable, otherwise it is NP-complete. In the paper we present a modification of the algorithm that works in polynomial time even for infinite constraint languages.