74 search results - page 1 / 15 » The communication complexity of the Hamming distance problem |
TOC
2008
13 years 4 months ago
2008
Abstract: Consider the following version of the Hamming distance problem for
IPL
2006
13 years 5 months ago
2006
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
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...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...