ECCC-Report TR14-022https://eccc.weizmann.ac.il/report/2014/022Comments and Revisions published for TR14-022en-usMon, 05 May 2014 21:00:03 +0300
Revision 1
| Fooling Pairs in Randomized Communication Complexity |
Shay Moran,
Makrand Sinha,
Amir Yehudayoff
https://eccc.weizmann.ac.il/report/2014/022#revision1Fooling pairs are one of the standard methods for proving lower bounds for deterministic two-player communication complexity. We study fooling pairs in the context of randomized communication complexity.
We show that every fooling pair induces far away distributions on transcripts of private-coin protocols. We then conclude that the private-coin randomized $\varepsilon$-error communication complexity of a function $f$ with a fooling set $\mathcal{S}$ is at least order $\log \frac{\log |\mathcal{S}|}{\varepsilon}$. This is tight, for example, for the equality and greater-than functions.Mon, 05 May 2014 21:00:03 +0300https://eccc.weizmann.ac.il/report/2014/022#revision1
Paper TR14-022
| Fooling Pairs in Randomized Communication Complexity |
Shay Moran,
Makrand Sinha,
Amir Yehudayoff
https://eccc.weizmann.ac.il/report/2014/022Fooling pairs are one of the standard methods for proving lower bounds for deterministic two-player communication complexity. We study fooling pairs in the context of randomized communication complexity.
We show that every fooling pair induces far away distributions on transcripts of private-coin protocols. We then conclude that the private-coin randomized $\varepsilon$-error communication complexity of a function $f$ with a fooling set $\mathcal{S}$ is at least order $\log \frac{\log |\mathcal{S}|}{\varepsilon}$. This is tight, for example, for the equality and greater-than functions.Wed, 19 Feb 2014 03:57:46 +0200https://eccc.weizmann.ac.il/report/2014/022