Improved Separations between Nondeterministic and Randomized Multiparty Communication

Download PDF
Open Webpage

Matei David, Toniann Pitassi, Emanuele Viola

Published: 2008, Last Modified: 15 May 2025APPROX-RANDOM 2008EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We exhibit an explicit function f : {0, 1}n →{0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n Ω(1) bits of communication for randomized number-on-forehead protocols with k = δ·logn players, for any fixed δ< 1. Recent breakthrough results for the Set-Disjointness function (Sherstov, STOC ’08; Lee Shraibman, CCC ’08; Chattopadhyay Ada, ECCC ’08) imply such a separation but only when the number of players is k < loglogn.