Quantum Query Complexity of Minor-Closed Graph Properties

DOI10.1137/110833026zbMath1261.68057OpenAlexW2103473460WikidataQ61604348 ScholiaQ61604348MaRDI QIDQ4910570

Andrew M. Childs, Robin Kothari

Publication date: 19 March 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2011/3052/

zbMATH Keywords

quantum algorithmslower boundsgraph propertiesgraph minorsquantum query complexity

Mathematics Subject Classification ID

Graph minors (05C83) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (4)

Quantum algorithm for triangle finding in sparse graphs ⋮ Quantum algorithm design: techniques and applications ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Quantum Query Complexity of Minor-Closed Graph Properties