Document Open Access Logo

Tractable Structures for Constraint Satisfaction with Truth Tables

Author Daniel Marx



PDF
Thumbnail PDF

File

LIPIcs.STACS.2009.1807.pdf
  • Filesize: 190 kB
  • 12 pages

Document Identifiers

Author Details

Daniel Marx

Cite AsGet BibTex

Daniel Marx. Tractable Structures for Constraint Satisfaction with Truth Tables. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 649-660, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/LIPIcs.STACS.2009.1807

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 {\em 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.
Keywords
  • Computational complexity
  • Constraint satisfaction
  • Treewidth
  • Adaptive width

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail