Name
Abstract | ||
|---|---|---|
We show an exponential gap between communication complexity and external information complexity by analyzing a communication task suggested as a candidate by Braverman [A Hard-to-Compress Interactive Task?, in Proceedings of the 51th Annual Allerton Conference on Communication, Control, and Computing, IEEE, 2013]. Previously, only a separation of communication complexity and internal information complexity was known. More precisely, we obtain an explicit example of a search problem with external information complexity at most O(k), with respect to any input distribution, and distributional communication complexity at least 2(k), with respect to some input distribution. In particular, this shows that a communication protocol cannot always be compressed to its external information. By a result of Braverman [SIAM J. Comput., 44 (2015), pp. 1698{1739], our gap is the largest possible. Moreover, since the upper bound of O(k) on the external information complexity of the problem is obtained with respect to any input distribution, our result implies an exponential gap between communication complexity and information complexity (both internal and external) in the nondistributional setting of Braverman [SIAM J. Comput., 44 (2015), pp. 1698{1739]. In this setting, no gap was previously known, even for internal information complexity. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1137/16M1096293 | SIAM JOURNAL ON COMPUTING |
Keywords | DocType | Volume |
communication complexity, communication compression, information complexity | Journal | 50 |
Issue | ISSN | Citations |
3 | 0097-5397 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anat Ganor | 1 | 0 | 0.34 |
| Gillat Kol | 2 | 19 | 3.44 |
| Ran Raz | 3 | 2772 | 180.87 |