A modifiction of the CSP algorithm for infinite languages

03/17/2018
by   Dmitriy Zhuk, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset