Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy

The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P or is NP-complete (Feder-Vardi, 1993). It has been verified for conservative problems (also known as list homomorphism problems) by A. Bulatov (2003). Egri et al. (SODA 2014) augmented this result by showing that for digraph templates H, every conservative CSP, denoted LHOM(H), is solvable in log space or is hard for NL. A conjecture of Larose and Tesson from 2007 forecasts that when LHOM(H) is in log space, then in fact, it falls in a small subclass of log space, the set of problems expressible in symmetric Data log. The present work verifies the conjecture for LHOM(H) (and, indeed, for the wider class of conservative CSPs with binary constraints), and by so doing sharpens the aforementioned dichotomy. A combinatorial characterization of symmetric Data log provides the language in which the algorithmic ideas of the paper, quite different from the ones in Egri et al., are formalized.

[1]  Pavol Hell,et al.  Bi-arc graphs and the complexity of list homomorphisms , 2003, J. Graph Theory.

[2]  László Egri.  On constraint satisfaction problems below P , 2016, J. Log. Comput..

[3]  Tomás Feder,et al.  Monotone monadic SNP and constraint satisfaction , 1993, STOC.

[4]  Pavol Hell,et al.  Space complexity of list H-colouring: a dichotomy , 2013, SODA.

[5]  Phokion G. Kolaitis,et al.  Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics , 2002, CP.

[6]  Jaroslav Nesetril,et al.  Short Answers to Exponentially Long Questions: Extremal Aspects of Homomorphism Duality , 2005, SIAM J. Discret. Math..

[7]  Víctor Dalmau,et al.  Maltsev + Datalog --≫ Symmetric Datalog , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[8]  Benoît Larose,et al.  Omitting Types, Bounded Width and the Ability to Count , 2009, Int. J. Algebra Comput..

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

[10]  Leonid Libkin,et al.  Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series) , 2004 .

[11]  Jaroslav Nesetril,et al.  Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations) , 2000, J. Comb. Theory, Ser. B.

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

[13]  Libor Barto,et al.  Constraint Satisfaction Problems Solvable by Local Consistency Methods , 2014, JACM.

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

[15]  Carsten Thomassen,et al.  Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.

[16]  Todd Niven,et al.  On the Reduction of the CSP Dichotomy Conjecture to Digraphs , 2013, CP.

[17]  Libor Barto,et al.  Constraint satisfaction problem and universal algebra , 2014, SIGL.

[18]  Libor Barto,et al.  Robust satisfiability of constraint satisfaction problems , 2012, STOC '12.

[19]  Pavol Hell,et al.  The dichotomy of list homomorphisms for digraphs , 2011, SODA '11.

[20]  Víctor Dalmau,et al.  Linear datalog and bounded path duality of relational structures , 2005, Log. Methods Comput. Sci..

[21]  Andrei A. Bulatov,et al.  Dualities for Constraint Satisfaction Problems , 2008, Complexity of Constraints.

[22]  Noga Alon,et al.  Colorings and orientations of graphs , 1992, Comb..

[23]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[24]  B. Larose,et al.  Bounded width problems and algebras , 2007 .

[25]  Anuj Dawar,et al.  Affine systems of equations and counting infinitary logic , 2009 .

[26]  Pascal Tesson,et al.  The Complexity of the List Homomorphism Problem for Graphs , 2011, Theory of Computing Systems.

[27]  Claude Tardif,et al.  A Characterisation of First-Order Constraint Satisfaction Problems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[28]  Andrei A. Bulatov,et al.  Complexity of conservative constraint satisfaction problems , 2011, TOCL.

[29]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[30]  Albert Atserias,et al.  On digraph coloring problems and treewidth duality , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[31]  Pascal Tesson,et al.  Symmetric Datalog and Constraint Satisfaction Problems in Logspace , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[32]  Pascal Tesson,et al.  Universal algebra and hardness results for constraint satisfaction problems , 2007, Theor. Comput. Sci..