License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CCC.2015.88
URN: urn:nbn:de:0030-drops-50769
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5076/
Go to the corresponding LIPIcs Volume Portal

Rao, Anup ; Yehudayoff, Amir

Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness

pdf-format:
28.pdf (0.5 MB)

Abstract

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^2n/2^k). We also simplify the proof of Sherstov's Omega(sqrt(n)/(k2^k)) lower bound for the randomized communication complexity of set disjointness.

BibTeX - Entry

@InProceedings{rao_et_al:LIPIcs:2015:5076,
  author =	{Anup Rao and Amir Yehudayoff},
  title =	{{Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness}},
  booktitle =	{30th Conference on Computational Complexity (CCC 2015)},
  pages =	{88--101},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-81-1},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{33},
  editor =	{David Zuckerman},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5076},
  URN =		{urn:nbn:de:0030-drops-50769},
  doi =		{10.4230/LIPIcs.CCC.2015.88},
  annote =	{Keywords: communication complexity, set disjointness, number on forehead, lower bounds}
}

Keywords: communication complexity, set disjointness, number on forehead, lower bounds
Collection: 30th Conference on Computational Complexity (CCC 2015)
Issue Date: 2015
Date of publication: 06.06.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI