The Unbounded-Error Communication Complexity of Symmetric Functions

Alexander A. Sherstov. The Unbounded-Error Communication Complexity of Symmetric Functions. In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA. pages 384-393, IEEE Computer Society, 2008. [doi]

Abstract

Abstract is missing.