Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness Anup Rao∗1 and Amir Yehudayoff†2 1 Department of Computer Science and Engineering

First Page		Document Content
Date: 2015-04-07 12:10:30 Computational complexity theory PP Communication complexity Pseudorandom generator Multiparty communication complexity Vitali covering lemma Theoretical computer science Applied mathematics Quantum complexity theory		Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness Anup Rao∗1 and Amir Yehudayoff†2 1 Department of Computer Science and Engineering Add to Reading List Source URL: homes.cs.washington.edu Download Document from Source Website File Size: 566,91 KB Share Document on Facebook