Abstract
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 (in: Proceedings of the 45th symposium on theory of computing (STOC), ACM, pp 161–170, 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.
Highlights
Protocols are commonly required to succeed with probability at least some constant less than 1, such as 3/4
There is a spectrum of complexities between these extremes, where we require a protocol to achieve success probability greater than one over the codomain size, i.e., advantage
We study the fine-grained question “How does the communication complexity of achieving advantage depend on ?”
Summary
Protocols are commonly required to succeed with probability at least some constant less than 1, such as 3/4. Achieving success probability one over the codomain size of the function is trivial by outputting a uniformly random guess. There is a spectrum of complexities between these extremes, where we require a protocol to achieve success probability greater than one over the codomain size, i.e., advantage. For a two-party function F , let Rp(F ) denote the minimum worst-case communication cost of any randomized protocol (with both public and private coins) that is p-correct in the sense that for each input (X, Y ) in the domain of F , it outputs F (X, Y ) with probability at least p. One observation is that running an advantage- protocol O(1/ 2) times independently and taking the majority outcome yields an advantage-1/4 protocol (we call this “majority-amplification”); i.e., R1/2+ (F ) ≥ Ω( 2R3/4(F )) This does not tell the whole story; achieving advantage may be harder than this bound suggests, depending on the function. In the functions Andm and Orm, the subscript indicates the number of input bits
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
