Tractable Structures for Constraint Satisfaction with Truth Tables - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

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.
Fichier principal
Vignette du fichier
54-marx.pdf (225.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00360101 , version 1 (10-02-2009)

Identifiers

  • HAL Id : inria-00360101 , version 1

Cite

Dániel Marx. Tractable Structures for Constraint Satisfaction with Truth Tables. 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. pp.649-660. ⟨inria-00360101⟩

Collections

STACS2009
56 View
138 Download

Share

Gmail Facebook X LinkedIn More