Skip to Main content Skip to Navigation
Theses

Toward a complexity classification of CSP through kernel width

Florian Richoux
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,
Document type :
Theses
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://pastel.archives-ouvertes.fr/pastel-00005564
Contributor : Ecole Polytechnique <>
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

Identifiers

  • HAL Id : pastel-00005564, version 1

Collections

Citation

Florian Richoux. Toward a complexity classification of CSP through kernel width. Computer Science [cs]. Ecole Polytechnique X, 2009. English. ⟨pastel-00005564⟩

Share

Metrics

Record views

200

Files downloads

162