论文信息 - The Unbounded-Error Communication Complexity of symmetric XOR functions

The Unbounded-Error Communication Complexity of symmetric XOR functions

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.

Hamed Hatami | Yingjie Qian

[1] Alexander A. Razborov,et al. The Sign-Rank of AC0 , 2010, SIAM J. Comput..

[2] A. S. The Pattern Matrix Method for Lower Bounds on Quantum Communication ∗ , 2007 .

[3] Alexander A. Sherstov. The unbounded-error communication complexity of symmetric functions , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[4] Raghav Kulkarni,et al. On the Spectral Properties of Symmetric Functions , 2017, ArXiv.

[5] Janos Simon,et al. Probabilistic Communication Complexity , 1986, J. Comput. Syst. Sci..

[6] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[7] Alexander A. Razborov,et al. The Sign-Rank of AC^O , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[8] Arkadev Chattopadhyay,et al. Dual polynomials and communication complexity of XOR functions , 2017, Electron. Colloquium Comput. Complex..

[9] Jürgen Forster. A linear lower bound on the unbounded error probabilistic communication complexity , 2002, J. Comput. Syst. Sci..

[10] A. Razborov. Quantum communication complexity of symmetric predicates , 2002, quant-ph/0204025.

[11] Alexander A. Sherstov. The pattern matrix method for lower bounds on quantum communication , 2008, STOC '08.

[12] Zhiqiang Zhang,et al. Communication complexities of symmetric XOR functions , 2009, Quantum Inf. Comput..