 |
Theses
Toward a complexity classification of CSP through kernel width
Abstract : 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,
Cited literature [28 references]
https://pastel.archives-ouvertes.fr/pastel-00005564
Contributor : Ecole Polytechnique Connect in order to contact the contributor
Submitted on : Tuesday, November 24, 2009 - 8:00:00 AM
Last modification on : Thursday, February 1, 2018 - 10:08:02 AM
Long-term archiving on: : Friday, October 19, 2012 - 12:50:12 PM
Contributor : Ecole Polytechnique Connect in order to contact the contributor
Submitted on : Tuesday, November 24, 2009 - 8:00:00 AM
Last modification on : Thursday, February 1, 2018 - 10:08:02 AM
Long-term archiving on: : Friday, October 19, 2012 - 12:50:12 PM