133 search results - page 2 / 27 » Lower Bounds on the Randomized Communication Complexity of R... |
CORR
2008
Springer
13 years 5 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...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
CIE
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
JC
2011
12 years 12 months ago
2011
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
DFG
1992
Springer
13 years 9 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...