The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms

Many graph parameters can be expressed as homomorphism counts to fixed target graphs; this includes the number of independent sets and the number of k-colorings for any fixed k. Dyer and Greenhill (RSA 2000) gave a sweeping complexity dichotomy for such problems, classifying which target graphs render the problem polynomial-time solvable or \(\#\mathrm {P}\)-hard. In this paper, we give a new and shorter proof of this theorem, with previously unknown tight lower bounds under the exponential-time hypothesis. We similarly strengthen complexity dichotomies by Focke, Goldberg, and Živný (SODA 2018) for counting surjective homomorphisms to fixed graphs. Both results crucially rely on our main contribution, a complexity dichotomy for evaluating linear combinations of homomorphism numbers to fixed graphs. In the terminology of Lovasz (Colloquium Publications 2012), this amounts to counting homomorphisms to quantum graphs.

[1]  Andrei A. Bulatov,et al.  The complexity of the counting constraint satisfaction problem , 2008, JACM.

[2]  Martin E. Dyer,et al.  The complexity of weighted and unweighted #CSP , 2010, J. Comput. Syst. Sci..

[3]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[4]  Jin-Yi Cai,et al.  The complexity of complex weighted Boolean #CSP , 2014, J. Comput. Syst. Sci..

[5]  László Lovász,et al.  Large Networks and Graph Limits , 2012, Colloquium Publications.

[6]  Leslie Ann Goldberg,et al.  A Complexity Dichotomy for Partition Functions with Mixed Signs , 2008, SIAM J. Comput..

[7]  Andreas Björklund,et al.  Computing the Tutte Polynomial in Vertex-Exponential Time , 2007, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[8]  Leslie Ann Goldberg,et al.  Counting Homomorphisms to Square-Free Graphs, Modulo 2 , 2016, TOCT.

[9]  Xi Chen,et al.  Complexity of Counting CSP with Complex Weights , 2011, J. ACM.

[10]  László Lovász,et al.  Left and right convergence of graphs with bounded degree , 2010, Random Struct. Algorithms.

[11]  Alexander Schrijver.  Graph Invariants in the Edge Model , 2008 .

[12]  L. Lovasz,et al.  Reflection positivity, rank connectivity, and homomorphism of graphs , 2004, math/0404468.

[13]  Dániel Marx,et al.  Exponential Time Complexity of the Permanent and the Tutte Polynomial , 2010, TALG.

[14]  Russell Impagliazzo,et al.  Which problems have strongly exponential complexity? , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[15]  Andrei A. Bulatov,et al.  The complexity of partition functions , 2005, Theor. Comput. Sci..

[16]  Hubie Chen,et al.  Counting Answers to Existential Positive Queries: A Complexity Classification , 2016, PODS.

[17]  Jakub W. Pachocki,et al.  Tight Bounds for Graph Homomorphism and Subgraph Isomorphism , 2016, SODA.

[18]  Martin E. Dyer,et al.  An Effective Dichotomy for the Counting Constraint Satisfaction Problem , 2010, SIAM J. Comput..

[19]  Dániel Marx,et al.  Homomorphisms are a good basis for counting small subgraphs , 2017, STOC.

[20]  Leslie Ann Goldberg,et al.  Counting Homomorphisms to Square-Free Graphs, Modulo 2 , 2015, ICALP.

[21]  Leslie Ann Goldberg,et al.  The Complexity of Counting Surjective Homomorphisms and Compactions , 2017, SODA.

[22]  Jin-Yi Cai,et al.  Graph Homomorphisms with Complex Values: A Dichotomy Theorem , 2009, SIAM J. Comput..

[23]  Martin E. Dyer,et al.  The complexity of counting graph homomorphisms , 2000, Random Struct. Algorithms.

[24]  Mark Jerrum,et al.  The Complexity of Parity Graph Homomorphism: An Initial Investigation , 2013, Theory Comput..

[25]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[26]  Leslie Ann Goldberg,et al.  The complexity of counting homomorphisms to cactus graphs modulo 2 , 2014, TOCT.

[27]  Russell Impagliazzo,et al.  Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[28]  Martin E. Dyer,et al.  On counting homomorphisms to directed acyclic graphs , 2006, JACM.