Tractable Structures for Constraint Satisfaction with Truth Tables

Abstract : The way the graph structure of the constraints influences the complexity of constraint satisfaction problems (CSP) is well understood for bounded-arity constraints. The situation is less clear if there is no bound on the arities. In this case the answer depends also on how the constraints are represented in the input. We study this question for the truth table representation of constraints. We introduce a new hypergraph measure adaptive width and show that CSP with truth tables is polynomial-time solvable if restricted to a class of hypergraphs with bounded adaptive width. Conversely, assuming a conjecture on the complexity of binary CSP, there is no other polynomial-time solvable case.
Type de document :
Communication dans un congrès
Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.649-660, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00360101
Contributeur : Publications Loria <>
Soumis le : mardi 10 février 2009 - 11:45:40
Dernière modification le : vendredi 8 décembre 2017 - 18:04:01
Document(s) archivé(s) le : mardi 8 juin 2010 - 22:10:23

Fichier

54-marx.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00360101, version 1

Collections

Citation

Dániel Marx. Tractable Structures for Constraint Satisfaction with Truth Tables. Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.649-660, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00360101〉

Partager

Métriques

Consultations de la notice

50

Téléchargements de fichiers

70