@inproceedings{0ec45dfa7c5240b2b4ea98c3421b67c3,
title = "Fooling pairs in randomized communication complexity",
abstract = "The fooling pairs method is 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 use the above to conclude that the private-coin randomized ε-error communication complexity of a function f with a fooling set S is at least order log log |S|/ε. This relationship was earlier known to hold only for constant values of ε. The bound we prove is tight, for example, for the equality and greaterthan functions. As an application, we exhibit the following dichotomy: for every boolean function f and integer n, the (1/3)-error public-coin randomized communication complexity of the function Vni=1 f(xi, yi) is either at most c or at least n/c, where c > 0 is a universal constant.",
author = "Shay Moran and Makrand Sinha and Amir Yehudayoff",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2016.; 23rd International Colloquium on Structural Information and Communication Complexity, SIROCCO 2016 ; Conference date: 19-07-2016 Through 21-07-2016",
year = "2016",
doi = "10.1007/978-3-319-48314-6\_4",
language = "الإنجليزيّة",
isbn = "9783319483139",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "49--59",
editor = "Jukka Suomela",
booktitle = "Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Revised Selected Papers",
}