Toward a complexity classification of CSP through kernel width - Archive ouverte HAL Access content directly
Theses Year : 2009

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,
Fichier principal
Vignette du fichier
memoire_submitted.pdf (1.11 Mo) Télécharger le fichier
Loading...

Dates and versions

pastel-00005564 , version 1 (24-11-2009)

Identifiers

  • HAL Id : pastel-00005564 , version 1

Cite

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

Collections

PASTEL PARISTECH
92 View
93 Download

Share

Gmail Facebook Twitter LinkedIn More