Non-dichotomies in Constraint Satisfaction Complexity

We show that every computational decision problem is polynomial-time equivalent to a constraint satisfaction problem (CSP) with an infinite template. We also construct for every decision problem Lan i¾?-categoricaltemplate Γsuch that Lreduces to CSP(Γ) and CSP(Γ) is in coNPL(i.e., the class coNP with an oracle for L). CSPs with i¾?-categorical templates are of special interest, because the universal-algebraic approach can be applied to study their computational complexity. Furthermore, we prove that there are i¾?-categorical templates with coNP-complete CSPs and i¾?-categorical templates with coNP- intermediate CSPs, i.e., problems in coNP that are neither coNP- complete nor in P (unless P=coNP). To construct the coNP-intermediate CSP with i¾?-categorical template we modify the proof of Ladner's theorem. A similar modification allows us to also prove a non-dichotomy result for a class of left-hand side restricted CSPs, which was left open in [10]. We finally show that if the so-called local-global conjecturefor infinite constraint languages(over a finite domain) is false, then there is no dichotomy for the constraint satisfaction problem for infinite constraint languages.

[1]  Pawel M. Idziak,et al.  Tractability and Learnability Arising from Algebras with Few Subpowers , 2010, SIAM J. Comput..

[2]  Peter Jeavons,et al.  Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..

[3]  Andrei A. Bulatov.  A graph of a relational structure and constraint satisfaction problems , 2004, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004..

[4]  C. Ward Henson,et al.  Countable homogeneous relational structures and ℵ0-categorical theories , 1972, Journal of Symbolic Logic.

[5]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[6]  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..

[7]  P. Jeavons.  Algebraic structures in combinatorial problems , 2001 .

[8]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[9]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

[10]  Bruce L. Bauslaugh,et al.  The Complexity of Infinite H-Coloring , 1994, J. Comb. Theory, Ser. B.

[11]  Manuel Bodirsky.  Constraint Satisfaction Problems with Infinite Templates , 2008, Complexity of Constraints.

[12]  G. Cherlin,et al.  The Classification of Countable Homogeneous Directed Graphs and Countable Homogeneous N-Tournaments , 1998 .

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

[14]  Yijia Chen,et al.  Understanding the Complexity of Induced Subgraph Isomorphisms , 2008, ICALP.

[15]  Goetz Schwandtner.  Datalog on infinite structures , 2008 .

[16]  Richard S. Varga,et al.  Proof of Theorem 5 , 1983 .

[17]  Wilfrid Hodges,et al.  A Shorter Model Theory , 1997 .

[18]  Martin Grohe,et al.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..