From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP

Inspired by computational complexity results for the quantified constraint satisfaction problem, we study the clones of idem potent polymorphisms of certain digraph classes. Our first results are two algebraic dichotomy, even "gap", theorems. Building on and extending [Martin CP'11], we prove that partially reflexive paths bequeath a set of idem potent polymorphisms whose associated clone algebra has: either the polynomially generated powers property (PGP), or the exponentially generated powers property (EGP). Similarly, we build on [DaMM ICALP'14] to prove that semi complete digraphs have the same property. These gap theorems are further motivated by new evidence that PGP could be the algebraic explanation that a QCSP is in NP even for unbounded alternation. Along the way we also effect a study of a concrete form of PGP known as collapsibility, tying together the algebraic and structural threads from [Chen Sicomp'08], and show that collapsibility is equivalent to its Pi2-restriction. We also give a decision procedure for k-collapsibility from a singleton source of a finite structure (a form of collapsibility which covers all known examples of PGP for finite structures). Finally, we present a new QCSP trichotomy result, for partially reflexive paths with constants. Without constants it is known these QCSPs are either in NL or Pspace-complete [Martin CP'11], but we prove that with constants they attain the three complexities NL, NP-complete and Pspace-complete.

[1]  Barnaby Martin,et al.  The Complexity of Positive First-order Logic without Equality , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[2]  Barnaby Martin,et al.  Quantified Constraints and Containment Problems , 2013, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

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

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

[5]  Jaroslav Nesetril,et al.  On the complexity of H-coloring , 1990, J. Comb. Theory, Ser. B.

[6]  Barnaby Martin,et al.  A Tetrachotomy for Positive First-Order Logic without Equality , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[7]  James Wiegold,et al.  Growth sequences of finite semigroups , 1987 .

[8]  Gustav Nordh,et al.  Retractions to Pseudoforests , 2010, SIAM J. Discret. Math..

[9]  Libor Barto,et al.  The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell) , 2008, SIAM J. Comput..

[10]  Barnaby Martin,et al.  QCSP on Semicomplete Digraphs , 2014, ICALP.

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

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

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

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

[15]  Barnaby Martin,et al.  The Complexity of Positive First-order Logic without Equality , 2009, LICS.

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

[17]  Barnaby Martin,et al.  Containment, Equivalence and Coreness from CSP to QCSP and beyond , 2012, CP.

[18]  Barnaby Martin.  QCSP on Partially Reflexive Forests , 2011, CP.

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

[20]  Manuel Bodirsky,et al.  Complexity Classification in Infinite-Domain Constraint Satisfaction , 2012, ArXiv.

[21]  Barnaby Martin,et al.  Towards a Trichotomy for Quantified H-Coloring , 2006, CiE.

[22]  Javier Esparza.  Automata, Languages, and Programming , 2014, Lecture Notes in Computer Science.

[23]  A BulatovAndrei.  A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006 .