Watson, Thomas
Communication Complexity with Small Advantage
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 (STOC 2013) showed that the setintersection function requires Theta(epsilon n) communication to achieve advantage epsilon. Building on this, we prove the same bound for several variants of setintersection: (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.
BibTeX  Entry
@InProceedings{watson:LIPIcs:2018:8880,
author = {Thomas Watson},
title = {{Communication Complexity with Small Advantage}},
booktitle = {33rd Computational Complexity Conference (CCC 2018)},
pages = {9:19:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770699},
ISSN = {18688969},
year = {2018},
volume = {102},
editor = {Rocco A. Servedio},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8880},
URN = {urn:nbn:de:0030drops88805},
doi = {10.4230/LIPIcs.CCC.2018.9},
annote = {Keywords: Communication, complexity, small, advantage}
}
2018
Keywords: 

Communication, complexity, small, advantage 
Seminar: 

33rd Computational Complexity Conference (CCC 2018)

Issue date: 

2018 
Date of publication: 

2018 