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

Hubie Chen, Radu Curticapean, Holger Dell (2019)

> Home

Details and statistics

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

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wg/ChenCD19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wg/ChenCD19
Hubie Chen, Radu Curticapean, Holger Dell:
The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. WG 2019: 364-378

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.