The Unbounded-Error Communication Complexity of Symmetric Functions

Authors:
Alexander A. Sherstov
Affiliations:
-
Venue:
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Year:
2008

Optimal bounds for sign-representing the intersection of two halfspaces by polynomials

Proceedings of the forty-second ACM symposium on Theory of computing
Composition theorems in communication complexity

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The Sign-Rank of AC$^0$

SIAM Journal on Computing
Communication complexities of symmetric XOR functions

Quantum Information & Computation

Hi-index	0.01

N/A