Highly Influenced

@article{Jayram2008TheOC, title={The One-Way Communication Complexity of Hamming Distance}, author={T. S. Jayram and Ravi Kumar and D. Sivakumar}, journal={Theory of Computing}, year={2008}, volume={4}, pages={129-135} }

- Published 2008 in Theory of Computing
DOI:10.4086/toc.2008.v004a006

Consider the following version of the Hamming distance problem for ±1 vectors of length n: the promise is that the distance is either at least 2 + √ n or at most 2 − √ n, and the goal is to find out which of these two cases occurs. Woodruff (Proc. ACM-SIAM Symposium on Discrete Algorithms, 2004) gave a linear lower bound for the randomized one-way… CONTINUE READING

Citations per Year

Semantic Scholar estimates that this publication has **64** citations based on the available data.

See our **FAQ** for additional information.

### Presentations referencing similar topics