![Computational complexity theory / PP / Communication complexity / Pseudorandom generator / Multiparty communication complexity / Vitali covering lemma / Theoretical computer science / Applied mathematics / Quantum complexity theory Computational complexity theory / PP / Communication complexity / Pseudorandom generator / Multiparty communication complexity / Vitali covering lemma / Theoretical computer science / Applied mathematics / Quantum complexity theory](https://www.pdfsearch.io/img/319a29ee6c005b07d616283d0bf0c1e8.jpg) Date: 2015-04-07 12:10:30Computational 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 EngineeringAdd to Reading ListSource URL: homes.cs.washington.eduDownload Document from Source Website File Size: 566,91 KBShare Document on Facebook
|