@InProceedings{mande_et_al:LIPIcs.TQC.2020.2,
author = {Mande, Nikhil S. and Thaler, Justin and Zhu, Shuchen},
title = {{Improved Approximate Degree Bounds for k-Distinctness}},
booktitle = {15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020)},
pages = {2:1--2:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-146-7},
ISSN = {1868-8969},
year = {2020},
volume = {158},
editor = {Flammia, Steven T.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2020.2},
URN = {urn:nbn:de:0030-drops-120613},
doi = {10.4230/LIPIcs.TQC.2020.2},
annote = {Keywords: Quantum Query Complexity, Approximate Degree, Dual Polynomials, k-distinctness}
}
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