Tractable Structures for Constraint Satisfaction with Truth Tables

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. Finally, we present a class of hypergraphs with bounded adaptive width and unbounded fractional hypertree width.

[1]  Dániel Marx,et al.  Can you beat treewidth? , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[2]  Georg Gottlob,et al.  Hypertree decompositions and tractable queries , 1998, J. Comput. Syst. Sci..

[3]  Andrei A. Bulatov,et al.  Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[4]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[5]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[6]  Georg Gottlob,et al.  Fixed-parameter complexity in AI and nonmonotonic reasoning , 1999, Artif. Intell..

[7]  Omer Reingold,et al.  Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[8]  Peter Jeavons,et al.  The complexity of maximal constraint languages , 2001, STOC '01.

[9]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[10]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[11]  Dániel Marx,et al.  Approximating fractional hypertree width , 2009, TALG.

[12]  Georg Gottlob,et al.  Uniform Constraint Satisfaction Problems and Database Theory , 2008, Complexity of Constraints.

[13]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

[14]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

[15]  Hubie Chen,et al.  Constraint satisfaction with succinctly specified relations , 2010, J. Comput. Syst. Sci..

[16]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006, JACM.

[17]  Martin Grohe,et al.  The Structure of Tractable Constraint Satisfaction Problems , 2006, MFCS.

[18]  Dániel Marx,et al.  Constraint solving via fractional edge covers , 2006, SODA '06.

[19]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[20]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[21]  Eugene C. Freuder.  Complexity of K-Tree Structured Constraint Satisfaction Problems , 1990, AAAI.

[22]  Thomas Schwentick,et al.  When is the evaluation of conjunctive queries tractable? , 2001, STOC '01.