Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness

Amit Chakrabarti, Subhash Khot, Xiaodong Sun. Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. In 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark. pages 107-117, IEEE Computer Society, 2003. [doi]

Abstract

Abstract is missing.