107 search results - page 1 / 22 » A Lower Bound for the Bounded Round Quantum Communication Co... |
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
COCO
2009
Springer
13 years 11 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
13 years 10 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 ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...