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.ITCS.2018.11
URN: urn:nbn:de:0030-drops-83322
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/8332/
Go to the corresponding LIPIcs Volume Portal

Braverman, Mark ; Ganor, Anat ; Kol, Gillat ; Raz, Ran

A Candidate for a Strong Separation of Information and Communication

pdf-format:
LIPIcs-ITCS-2018-11.pdf (0.5 MB)

Abstract

The weak interactive compression conjecture asserts that any two-party communication protocol with communication complexity C and information complexity I can be compressed to a protocol with communication complexity poly(I)polylog(C).

We describe a communication problem that is a candidate for refuting that conjecture. Specifically, while we show that the problem can be solved by a protocol with communication complexity C and information complexity I=polylog(C), the problem seems to be hard for protocols with communication complexity poly(I)polylog(C)=polylog(C).

BibTeX - Entry

@InProceedings{braverman_et_al:LIPIcs:2018:8332,
  author =	{Mark Braverman and Anat Ganor and Gillat Kol and Ran Raz},
  title =	{{A Candidate for a Strong Separation of Information and Communication}},
  booktitle =	{9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
  pages =	{11:1--11:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-060-6},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{94},
  editor =	{Anna R. Karlin},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8332},
  URN =		{urn:nbn:de:0030-drops-83322},
  doi =		{10.4230/LIPIcs.ITCS.2018.11},
  annote =	{Keywords: communication complexity, amortized communication complexity, communication compression, direct sum, information complexity}
}

Keywords: communication complexity, amortized communication complexity, communication compression, direct sum, information complexity
Collection: 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Issue Date: 2018
Date of publication: 12.01.2018

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