Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness

被引：12
|
作者：
Rao, Anup [1 ]
Yehudayoff, Amir [2 ]
机构：
[1] Univ Washington, Dept Comp Sci & Engn, Seattle, WA 98195 USA
[2] Technion IIT, Dept Math, Haifa, Israel
来源：
30TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2015) | 2015年 / 33卷
基金：
美国国家科学基金会; 以色列科学基金会;
关键词：
communication complexity; number-on-forehead model; set disjointness; lower bounds; PROTOCOLS; CIRCUITS; SIZE;
D O I：
10.4230/LIPIcs.CCC.2015.88
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We show that the deterministic number-on-forehead communication complexity of set disjointness for k parties on a universe of size n is Omega(n/4(k)). This gives the first lower bound that is linear in n, nearly matching Grolmusz's upper bound of O(log(2)(n) + k(2)n/2(k)). We also simplify the proof of Sherstov's Omega(root n/(k2(k))) lower bound for the randomized communication complexity of set disjointness.
引用
收藏
页码：88 / 101
页数：14
相关论文
共 50 条
12345