Toward a complexity classification of CSP through kernel width
Florian Richoux · HAL (Le Centre pour la Communication Scientifique Directe) · 2009
Constraint Satisfaction Problems (CSP) constitute a universal formalism allowing to modelize a huge number of algorithmical and combinatorial problems, such as problems over graphs, databases, artificial intelligence,