ECCC-Report TR14-101https://eccc.weizmann.ac.il/report/2014/101Comments and Revisions published for TR14-101en-usThu, 01 Jan 2015 09:56:50 +0200
Revision 1
| Internal compression of protocols to entropy |
Shay Moran,
Amir Yehudayoff,
Balthazar Bauer
https://eccc.weizmann.ac.il/report/2014/101#revision1We study internal compression of communication protocols to their internal entropy, which is the entropy of the transcript from the players' perspective. We first show that errorless compression to the internal entropy (and hence to the internal information) is impossible. We then provide two internal compression schemes with error. One of a protocol of Fiege et al. for finding the first difference between two strings. The second and main one is an internal compression with error $\epsilon > 0$ of a protocol with internal entropy $H^{int}$ and communication complexity $C$ to a protocol with communication at most order $(H^{int}/\epsilon)^2 \log(\log(C))$.
This immediately implies a similar compression to the internal information of public coin protocols, which exponentially improves over previously known public coin compressions in the dependence on $C$. It further shows that in a recent protocol of Ganor, Kol and Raz it is impossible to move the private randomness to be public without an exponential cost.
To the best of our knowledge, no such example was previously known.Thu, 01 Jan 2015 09:56:50 +0200https://eccc.weizmann.ac.il/report/2014/101#revision1
Paper TR14-101
| Internal compression of protocols to entropy |
Shay Moran,
Amir Yehudayoff,
Balthazar Bauer
https://eccc.weizmann.ac.il/report/2014/101We study internal compression of communication protocols
to their internal entropy, which is the entropy of the transcript from the players' perspective.
We first show that errorless compression to the internal entropy
(and hence to the internal information) is impossible.
We then provide two internal compression schemes with error.
One of a protocol of Fiege et al. for finding the first difference
between two strings.
The second and main one is an internal compression with error $\epsilon > 0$ of a protocol with internal entropy $H^{int}$ and communication complexity $C$ to a protocol with communication at most order $(H^{int}/\epsilon)^2 \log(\log(C))$.
This immediately implies a similar compression to the internal information of public coin protocols, which exponentially improves over previously known public coin compressions in the dependence on $C$.
It further shows that in a recent protocol of Ganor, Kol and Raz it is impossible to move the private randomness to be public without an
exponential cost.
To the best of our knowledge, no such example was previously known.Fri, 08 Aug 2014 14:52:51 +0300https://eccc.weizmann.ac.il/report/2014/101