Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Shay Moran:

TR14-022 | 19th February 2014
Shay Moran, Makrand Sinha, Amir Yehudayoff

Fooling Pairs in Randomized Communication Complexity

Revisions: 1

Fooling 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 ... more >>>

ISSN 1433-8092 | Imprint