Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- articleMay 2018
A polynomial relational class of binary CSP
Annals of Mathematics and Artificial Intelligence (KLU-AMAI), Volume 83, Issue 1Pages 1–20https://doi.org/10.1007/s10472-017-9566-6Finding a solution to a constraint satisfaction problem (CSP) is known to be an NP-hard task. Considerable effort has been spent on identifying tractable classes of CSP, in other words, classes of constraint satisfaction problems for which there are ...
- articleApril 2016
Tractability in constraint satisfaction problems: a survey
Even though the Constraint Satisfaction Problem (CSP) is NP-complete, many tractable classes of CSP instances have been identified. After discussing different forms and uses of tractability, we describe some landmark tractable classes and survey recent ...