The Exponential Time complexity of counting (quantum) graph homomorphisms

DOI10.1007/978-3-030-30786-8_28OpenAlexW2973077305MaRDI QIDQ2301557

Radu Curticapean, Holger Dell, Hubie Chen

Publication date: 24 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-30786-8_28

zbMATH Keywords

graph homomorphismscomplexity dichotomycounting complexitysurjective homomorphismsExponential Time Hypothesis

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2

This page was built for publication: The Exponential Time complexity of counting (quantum) graph homomorphisms