An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance

Amit Chakrabarti Oded Regev

Published in: CoRR (2010)

Keyphrases

hamming distance
lower bound
worst case
upper bound
optimal solution
binary strings
branch and bound algorithm
pattern matching
distance measure
competitive ratio
dynamic programming
hamming space
binary codes
np hard
closed form
database systems
high dimensional