The Exponential Time complexity of counting (quantum) graph homomorphisms
type: Item
instance of: scholarly article
title: The Exponential Time complexity of counting (quantum) graph homomorphisms
DOI: 10.1007/978-3-030-30786-8_28
author: Hubie Chen
author: Radu Curticapean
author: Holger Dell
publication date: 2020-02-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7173313
zbMATH Keywords: graph homomorphisms
zbMATH Keywords: Exponential Time Hypothesis
zbMATH Keywords: counting complexity
zbMATH Keywords: complexity dichotomy
zbMATH Keywords: surjective homomorphisms
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-030-30786-8 28
OpenAlex ID: W2973077305
Recommended article: Q4521549
Recommended article: Q4952624
Recommended article: Quantum time complexity and algorithms for pattern matching on labeled graphs
Recommended article: Exponential-time quantum algorithms for graph coloring problems
Recommended article: Quantum Query Complexity of Some Graph Problems
Recommended article: Automata, Languages and Programming
Recommended article: Quantum Query Complexity of Subgraph Isomorphism and Homomorphism
Recommended article: SOFSEM 2004: Theory and Practice of Computer Science
Recommended article: Q4684735
description: scientific article; zbMATH DE number 7173313