Tractability in Constraint Satisfaction Problems: A Survey - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Constraints Année : 2016

Tractability in Constraint Satisfaction Problems: A Survey

Résumé

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 theoretical results. Although we concentrate on the classical CSP, we also cover its important extensions to infinite domains and optimisation, as well as #CSP and QCSP.
Fichier principal
Vignette du fichier
surveyV5.pdf (258.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01230685 , version 1 (18-11-2015)

Identifiants

Citer

Clément Carbonnel, Martin Cooper. Tractability in Constraint Satisfaction Problems: A Survey. Constraints, 2016, 21 (2), pp.115-144. ⟨10.1007/s10601-015-9198-6⟩. ⟨hal-01230685⟩
759 Consultations
843 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More