@InProceedings{cornelissen_et_al:LIPIcs.FSTTCS.2022.15,
author = {Cornelissen, Arjan and Mande, Nikhil S. and Patro, Subhasree},
title = {{Improved Quantum Query Upper Bounds Based on Classical Decision Trees}},
booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022)},
pages = {15:1--15:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-261-7},
ISSN = {1868-8969},
year = {2022},
volume = {250},
editor = {Dawar, Anuj and Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.15},
URN = {urn:nbn:de:0030-drops-174071},
doi = {10.4230/LIPIcs.FSTTCS.2022.15},
annote = {Keywords: Quantum Query Complexity, Decision Trees, Decision Tree Rank}
}