@InProceedings{bendavid:LIPIcs.TQC.2016.7,
author = {Ben-David, Shalev},
title = {{The Structure of Promises in Quantum Speedups}},
booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)},
pages = {7:1--7:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-019-4},
ISSN = {1868-8969},
year = {2016},
volume = {61},
editor = {Broadbent, Anne},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2016.7},
URN = {urn:nbn:de:0030-drops-66882},
doi = {10.4230/LIPIcs.TQC.2016.7},
annote = {Keywords: Quantum computing, quantum query complexity, decision tree complexity, lower bounds, quantum adversary method}
}