eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2018-06-04
9:1
9:17
10.4230/LIPIcs.CCC.2018.9
article
Communication Complexity with Small Advantage
Watson, Thomas
1
Department of Computer Science, University of Memphis, Memphis, TN, USA
We study problems in randomized communication complexity when the protocol is only required to attain some small advantage over purely random guessing, i.e., it produces the correct output with probability at least epsilon greater than one over the codomain size of the function. Previously, Braverman and Moitra (STOC 2013) showed that the set-intersection function requires Theta(epsilon n) communication to achieve advantage epsilon. Building on this, we prove the same bound for several variants of set-intersection: (1) the classic "tribes" function obtained by composing with And (provided 1/epsilon is at most the width of the And), and (2) the variant where the sets are uniquely intersecting and the goal is to determine partial information about (say, certain bits of the index of) the intersecting coordinate.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol102-ccc2018/LIPIcs.CCC.2018.9/LIPIcs.CCC.2018.9.pdf
Communication
complexity
small
advantage