222 search results - page 2 / 45 » Lower Bounds on Quantum Multiparty Communication Complexity |
SODA
2012
ACM
11 years 7 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
2003
Springer
13 years 9 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 ...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We obtain a lower bound of n 1 k+1 22k (k-1)2k-1 on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of mul...
STOC
2007
ACM
14 years 4 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....