The Unbounded-Error Communication Complexity of symmetric XOR functions
Computational Complexity
2017-04-18 v2
Abstract
Settling a conjecture of Shi and Zhang, we determine the unbounded-error communication complexity of the symmetric XOR functions up to a poly-logarithmic factor. Our proof is by a simple reduction to an earlier result of Sherstov.
Cite
@article{arxiv.1704.00777,
title = {The Unbounded-Error Communication Complexity of symmetric XOR functions},
author = {Hamed Hatami and Yingjie Qian},
journal= {arXiv preprint arXiv:1704.00777},
year = {2017}
}