Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/inria-00360101
Contributor : Publications Loria <>
Submitted on : Tuesday, February 10, 2009 - 11:45:40 AM
Last modification on : Friday, December 8, 2017 - 6:04:01 PM
Long-term archiving on: : Tuesday, June 8, 2010 - 10:10:23 PM

File

54-marx.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00360101, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

116

Files downloads

230