@InProceedings{magnin_et_al:LIPIcs.STACS.2013.434,
author = {Magnin, Lo\"{i}ck and Roland, J\'{e}r\'{e}mie},
title = {{Explicit relation between all lower bound techniques for quantum query complexity}},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)},
pages = {434--445},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-50-7},
ISSN = {1868-8969},
year = {2013},
volume = {20},
editor = {Portier, Natacha and Wilke, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.434},
URN = {urn:nbn:de:0030-drops-39548},
doi = {10.4230/LIPIcs.STACS.2013.434},
annote = {Keywords: Quantum computation, lower bound, adversary method, polynomial method}
}