TY - JOUR

T1 - Public vs. private randomness in simultaneous multi-party communication complexity

AU - Fischer, Orr

AU - Oshman, Rotem

AU - Zwick, Uri

N1 - Publisher Copyright:
© 2018 Elsevier B.V.

PY - 2020/3/2

Y1 - 2020/3/2

N2 - In simultaneous number-in-hand multi-party communication protocols, we have k players, who each receive a private input, and wish to compute a joint function of their inputs. The players simultaneously each send a single message to a referee, who then outputs the value of the function. The cost of the protocol is the total number of bits sent to the referee. For two players, it is known that giving the players a public (shared) random string is much more useful than private randomness: public-coin protocols can be unboundedly better than deterministic protocols, while private-coin protocols can only give a quadratic improvement on deterministic protocols. We extend the two-player gap to multiple players, and show that the private-coin communication complexity of a k-player function f is at least Ω(D(f)) for any k≥2. Perhaps surprisingly, this bound is tight: although one might expect the gap between private-coin and deterministic protocols to grow with the number of players, we show that the All-Equality function, where each player receives n bits of input and the players must determine if their inputs are all the same, can be solved by a private-coin protocol with O˜(nk+k) bits. Since All-Equality has deterministic complexity Θ(nk), this shows that sometimes the gap scales only as the square root of the number of players, and consequently the number of bits each player needs to send actually decreases as the number of players increases. We also consider the Exists-Equality function, where we ask whether there is a pair of players that received the same input, and prove a nearly-tight bound of Θ˜(kn) for it.

AB - In simultaneous number-in-hand multi-party communication protocols, we have k players, who each receive a private input, and wish to compute a joint function of their inputs. The players simultaneously each send a single message to a referee, who then outputs the value of the function. The cost of the protocol is the total number of bits sent to the referee. For two players, it is known that giving the players a public (shared) random string is much more useful than private randomness: public-coin protocols can be unboundedly better than deterministic protocols, while private-coin protocols can only give a quadratic improvement on deterministic protocols. We extend the two-player gap to multiple players, and show that the private-coin communication complexity of a k-player function f is at least Ω(D(f)) for any k≥2. Perhaps surprisingly, this bound is tight: although one might expect the gap between private-coin and deterministic protocols to grow with the number of players, we show that the All-Equality function, where each player receives n bits of input and the players must determine if their inputs are all the same, can be solved by a private-coin protocol with O˜(nk+k) bits. Since All-Equality has deterministic complexity Θ(nk), this shows that sometimes the gap scales only as the square root of the number of players, and consequently the number of bits each player needs to send actually decreases as the number of players increases. We also consider the Exists-Equality function, where we ask whether there is a pair of players that received the same input, and prove a nearly-tight bound of Θ˜(kn) for it.

KW - Communication complexity

KW - Multi-party communication complexity

KW - Number in hand

KW - Simultaneous communication complexity

UR - http://www.scopus.com/inward/record.url?scp=85051112207&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2018.04.032

DO - 10.1016/j.tcs.2018.04.032

M3 - מאמר

AN - SCOPUS:85051112207

VL - 810

SP - 72

EP - 81

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -