The Exponential Time complexity of counting (quantum) graph homomorphisms (Q2301557)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7173313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Exponential Time complexity of counting (quantum) graph homomorphisms |
scientific article; zbMATH DE number 7173313 |
Statements
The Exponential Time complexity of counting (quantum) graph homomorphisms (English)
0 references
24 February 2020
0 references
graph homomorphisms
0 references
Exponential Time Hypothesis
0 references
counting complexity
0 references
complexity dichotomy
0 references
surjective homomorphisms
0 references
0 references
0.88943416
0 references
0.88943416
0 references
0.8889731
0 references
0 references
0.8843659
0 references
0.8783763
0 references
