On Backdoors to Tractable Constraint Languages - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

On Backdoors to Tractable Constraint Languages

Résumé

In the context of CSPs, a strong backdoor is a subset of variables such that every complete assignment yields a residual instance guaranteed to have a specified property. If the property allows efficient solving, then a small strong backdoor provides a reasonable decomposition of the original instance into easy instances. An important challenge is the design of algorithms that can find quickly a small strong backdoor if one exists. We present a systematic study of the parameterized complexity of backdoor detection when the target property is a restricted type of constraint language defined by means of a family of polymor-phisms. In particular, we show that under the weak assumption that the polymorphisms are idempotent, the problem is unlikely to be FPT when the parameter is either r (the constraint arity) or k (the size of the backdoor) unless P = NP or FPT = W[2]. When the parameter is k + r, however, we are able to identify large classes of languages for which the problem of finding a small backdoor is FPT.
Fichier principal
Vignette du fichier
paper.pdf (323.28 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01154625 , version 1 (23-05-2015)

Identifiants

Citer

Clément Carbonnel, Martin Cooper, Emmanuel Hébrard. On Backdoors to Tractable Constraint Languages. Principles and Practice of Constraint Programming, Sep 2014, Lyon, France. pp.224-239, ⟨10.1007/978-3-319-10428-7_18⟩. ⟨hal-01154625⟩
210 Consultations
69 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More