103
click to vote
CORR
2010
Springer
15 years 16 days 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...