QCSP on Reflexive Tournaments

We give a complexity dichotomy for the Quantified Constraint Satisfaction Problem QCSP(H) when H is a reflexive tournament. It is well-known that reflexive tournaments can be split into a sequence of strongly connected components H₁,…,H_n so that there exists an edge from every vertex of H_i to every vertex of H_j if and only if i < j. We prove that if H has both its initial and final strongly connected component (possibly equal) of size 1, then QCSP(H) is in NL and otherwise QCSP(H) is NP-hard.

[1]  Andrei A. Krokhin,et al.  Majority constraints have bounded pathwidth duality , 2008, Eur. J. Comb..

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

[3]  Gary MacGillivray,et al.  The Complexity of Colouring by Semicomplete Digraphs , 1988, SIAM J. Discret. Math..

[4]  B. Larose,et al.  Finite posets and topological spaces in locally finite varieties , 2005 .

[5]  Dmitriy Zhuk.  No-Rainbow Problem and the Surjective Constraint Satisfaction Problem , 2020 .

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

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

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

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

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

[11]  Phokion G. Kolaitis,et al.  Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series) , 2005 .

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

[13]  Narayan Vikas,et al.  Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon , 2017, MFCS.

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

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

[16]  Jian Song,et al.  Computing vertex-surjective homomorphisms to partially reflexive trees , 2011, Theor. Comput. Sci..

[17]  Barnaby Martin,et al.  Quantified Constraint Satisfaction Problem on Semicomplete Digraphs , 2017, ACM Trans. Comput. Log..

[18]  Narayan Vikas.  Algorithms for Partition of Some Class of Graphs under Compaction and Vertex-Compaction , 2012, Algorithmica.

[19]  Barnaby Martin,et al.  QCSP monsters and the demise of the chen conjecture , 2020, STOC.

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

[21]  Barnaby Martin,et al.  The complexity of surjective homomorphism problems - a survey , 2011, Discret. Appl. Math..

[22]  Alexander Wires.  Dichotomy for finite tournaments of mixed-type , 2015, Discret. Math..