@InProceedings{childs_et_al:LIPIcs.STACS.2011.661,
author = {Childs, Andrew M. and Kothari, Robin},
title = {{Quantum query complexity of minor-closed graph properties}},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)},
pages = {661--672},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-25-5},
ISSN = {1868-8969},
year = {2011},
volume = {9},
editor = {Schwentick, Thomas and D\"{u}rr, Christoph},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.661},
URN = {urn:nbn:de:0030-drops-30521},
doi = {10.4230/LIPIcs.STACS.2011.661},
annote = {Keywords: quatum query complexity, quantum algorithms, lower bounds, graph minors, graph properties}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode