文章基本信息
- 标题：Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness
- 本地全文：下载
- 作者：Anup Rao ; Amir Yehudayoff
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2014
- 卷号：2014
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：
We show that the deterministic multiparty communication complexity of set disjointness for k parties on a universe of size n is (n4k) . We also simplify Sherstov's proofshowing an (n(k2k)) lower bound for the randomized communication complexity of set disjointness.
- 关键词：disjointness; Number-On-Forehead
