Quantum Query Complexity of Subgraph Isomorphism and Homomorphism
From MaRDI portal
Publication:4601900
DOI10.4230/LIPICS.STACS.2016.48zbMath1388.68071arXiv1509.06361OpenAlexW2963214524MaRDI QIDQ4601900
Supartha Podder, Raghav Kulkarni
Publication date: 24 January 2018
Full work available at URL: https://arxiv.org/abs/1509.06361
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Quantum algorithms and complexity in the theory of computing (68Q12)
This page was built for publication: Quantum Query Complexity of Subgraph Isomorphism and Homomorphism