QCSP monsters and the demise of the chen conjecture

We give a surprising classification for the computational complexity of the Quantified Constraint Satisfaction Problem over a constraint language Γ, QCSP(Γ), where Γ is a finite language over 3 elements which contains all constants. In particular, such problems are either in P, NP-complete, co-NP-complete or PSpace-complete. Our classification refutes the hitherto widely-believed Chen Conjecture. Additionally, we show that already on a 4-element domain there exists a constraint language Γ such that (Γ) is DP-complete (from Boolean Hierarchy), and on a 10-element domain there exists a constraint language giving the complexity class Θ2P. Meanwhile, we prove the Chen Conjecture for finite conservative languages Γ. If the polymorphism clone of such Γ has the polynomially generated powers (PGP) property then QCSP(Γ) is in NP. Otherwise, the polymorphism clone of Γ has the exponentially generated powers (EGP) property and QCSP(Γ) is PSpace-complete.

[1]  Thomas Lukasiewicz,et al.  A novel characterization of the complexity class ϴPk based on counting and comparison , 2017, Theor. Comput. Sci..

[2]  Emil L. Post.  The two-valued iterative systems of mathematical logic , 1942 .

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

[4]  Hubie Chen,et al.  The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case , 2006, SIAM J. Comput..

[5]  Vladimir Kolmogorov,et al.  The Complexity of General-Valued CSPs , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[6]  D. Geiger.  CLOSED SYSTEMS OF FUNCTIONS AND PREDICATES , 1968 .

[7]  Manuel Bodirsky,et al.  Relatively quantified constraint satisfaction , 2009, Constraints.

[8]  M. Maróti,et al.  Existence theorems for weakly symmetric operations , 2008 .

[9]  Peter Jeavons,et al.  The complexity of constraint satisfaction games and QCSP , 2009, Inf. Comput..

[10]  Magnus Wahlström,et al.  The power of primitive positive definitions with polynomially many variables , 2017, J. Log. Comput..

[11]  Hubie Chen.  Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms , 2004, CP.

[12]  Hubie Chen.  Quantified constraint satisfaction and the polynomially generated powers property , 2011 .

[13]  Venkatesan Guruswami,et al.  Promise Constraint Satisfaction: Structure Theory and a Symmetric Boolean Dichotomy , 2018, SODA.

[14]  Hubie Chen.  Meditations on Quantified Constraint Satisfaction , 2012, Logic and Program Semantics.

[15]  L. A. Kaluzhnin,et al.  Galois theory for post algebras. I , 1969 .

[16]  Samuel R. Buss,et al.  On Truth-Table Reducibility to SAT , 1991, Inf. Comput..

[17]  Hubie Chen,et al.  A rendezvous of logic, complexity, and algebra , 2009, CSUR.

[18]  Barnaby Martin,et al.  The Complexity of Quantified Constraints Using the Algebraic Formulation , 2017, MFCS.

[19]  Hubie Chen,et al.  Quantified Constraint Satisfaction on Monoids , 2016, CSL.

[20]  Barnaby Martin,et al.  From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP , 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science.

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

[22]  Dmitriy Zhuk.  The size of generating sets of powers , 2019, J. Comb. Theory, Ser. A.

[23]  Barnaby Martin,et al.  Quantified Constraints and Containment Problems , 2008, LICS.

[24]  Andrei A. Bulatov,et al.  A Dichotomy Theorem for Nonuniform CSPs , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[25]  Dmitriy Zhuk,et al.  A Proof of CSP Dichotomy Conjecture , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[26]  Barnaby Martin,et al.  On the complexity of the model checking problem , 2012, SIAM J. Comput..

[27]  Barnaby Martin.  Quantified Constraints in Twenty Seventeen , 2017, The Constraint Satisfaction Problem.

[28]  Libor Barto,et al.  The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).