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

Amit Chakrabarti Oded Regev

Published in: SIAM J. Comput. (2012)

Keyphrases

hamming distance
lower bound
worst case
optimal solution
upper bound
distance measure
pattern matching
dynamic programming
branch and bound algorithm
binary strings
np hard
multi dimensional
competitive ratio
object recognition
binary representation