@inproceedings{ac1cf8b19a7a4d0799893a832d21d1df,
title = "Simplified lower bounds on the multiparty communication complexity of disjointness",
abstract = "We show that the deterministic number-on-forehead communication complexity of set disjointness for k parties on a universe of size n is Ω(n/4k). This gives the first lower bound that is linear in n, nearly matching Grolmusz's upper bound of O(log2(n) + k2n/2k). We also simplify the proof of Sherstov's Ω(√n/(k2k)) lower bound for the randomized communication complexity of set disjointness.",
keywords = "Communication complexity, Lower bounds, Number-on-forehead model, Set disjointness",
author = "Anup Rao and Amir Yehudayoff",
note = "Publisher Copyright: {\textcopyright} Anup Rao and Amir Yehudayoff; licensed under Creative Commons License CC-BY.; 30th Conference on Computational Complexity, CCC 2015 ; Conference date: 17-06-2015 Through 19-06-2015",
year = "2015",
month = jun,
day = "1",
doi = "https://doi.org/10.4230/LIPIcs.CCC.2015.88",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
pages = "88--101",
editor = "David Zuckerman",
booktitle = "30th Conference on Computational Complexity, CCC 2015",
}