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

Hubie Chen, Radu Curticapean, Holger Dell (2019)

Details and statistics

DOI: 10.1007/978-3-030-30786-8_28

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-17

a service of  Schloss Dagstuhl - Leibniz Center for Informatics