Mark Bun, Robin Kothari, Justin Thaler. The polynomial method strikes back: tight quantum query bounds via dual polynomials. In Ilias Diakonikolas, David Kempe 0001, Monika Henzinger, editors, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018. pages 297-310, ACM, 2018. [doi]
@inproceedings{BunKT18,
title = {The polynomial method strikes back: tight quantum query bounds via dual polynomials},
author = {Mark Bun and Robin Kothari and Justin Thaler},
year = {2018},
doi = {10.1145/3188745.3188784},
url = {http://doi.acm.org/10.1145/3188745.3188784},
researchr = {https://researchr.org/publication/BunKT18},
cites = {0},
citedby = {0},
pages = {297-310},
booktitle = {Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018},
editor = {Ilias Diakonikolas and David Kempe 0001 and Monika Henzinger},
publisher = {ACM},
}