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

Hubie Chen, Radu Curticapean, Holger Dell (2019)
a service of Schloss Dagstuhl - Leibniz Center for Informatics