Sciweavers

SODA
2012
ACM
245views Algorithms» more  SODA 2012»
12 years 1 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
CORR
2010
Springer
91views Education» more  CORR 2010»
13 years 11 months ago
A Separation of NP and coNP in Multiparty Communication Complexity
: We prove that coNP MA in the number-on-forehead model of multiparty communication complexity for up to k = (1 - )logn players, where > 0 is any constant. Specifically, we con...
Dmitry Gavinsky, Alexander A. Sherstov
ICALP
2005
Springer
14 years 5 months ago
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
Jeff Ford, Anna Gál