20 search results - page 1 / 4 » Hadamard Tensors and Lower Bounds on Multiparty Communicatio... |
ICALP
2005
Springer
15 years 9 hour ago
2005
Springer
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...
SODA
2012
ACM
12 years 9 months ago
2012
ACM
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 ...
COCO
2009
Springer
15 years 1 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
COCO
2003
Springer
14 years 11 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
TAMC
2007
Springer
15 years 18 days ago
2007
Springer
