Sciweavers

CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 1 months ago
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
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...
Amit Chakrabarti, Oded Regev