Improved Separations between Nondeterministic and Randomized Multiparty Communication

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 =

• Type: Conference
• Year: 2008
• Where: APPROX
• Authors: Matei David, Toniann Pitassi, Emanuele Viola
• Keywords: Algorithms, APPROX 2008, Explicit Function, Nondeterministic Number-on-forehead Protocol, Number-on-forehead Protocols