91 search results - page 1 / 19 » Multiparty Communication Complexity of Disjointness |
111
Voted
CORR
2008
Springer
15 years 3 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...
146
click to vote
COCO
2003
Springer
15 years 8 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 ...
114
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
157
click to vote
COCO
2009
Springer
15 years 10 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...
119
click to vote
ICALP
2005
Springer
15 years 9 months 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...