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

Hubie Chen, Radu Curticapean, Holger Dell. The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. In Ignasi Sau, Dimitrios M. Thilikos, editors, Graph-Theoretic Concepts in Computer Science - 45th International Workshop, WG 2019, Vall de NĂºria, Spain, June 19-21, 2019, Revised Papers. Volume 11789 of Lecture Notes in Computer Science, pages 364-378, Springer, 2019. [doi]

Abstract

Abstract is missing.