@InProceedings{guan_et_al:LIPIcs.STACS.2024.39,
author = {Guan, Ziyi and Huang, Yunqi and Yao, Penghui and Ye, Zekun},
title = {{Quantum and Classical Communication Complexity of Permutation-Invariant Functions}},
booktitle = {41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024)},
pages = {39:1--39:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-311-9},
ISSN = {1868-8969},
year = {2024},
volume = {289},
editor = {Beyersdorff, Olaf and Kant\'{e}, Mamadou Moustapha and Kupferman, Orna and Lokshtanov, Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2024.39},
URN = {urn:nbn:de:0030-drops-197498},
doi = {10.4230/LIPIcs.STACS.2024.39},
annote = {Keywords: Communication complexity, Permutation-invariant functions, Log-rank Conjecture, Quantum advantages}
}
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