Login / Signup
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance.
Amit Chakrabarti
Oded Regev
Published in:
Electron. Colloquium Comput. Complex. (2010)
Keyphrases
</>
hamming distance
lower bound
worst case
optimal solution
upper bound
binary strings
competitive ratio
branch and bound algorithm
objective function
binary representation
neural network
distance measure
pattern matching
nearest neighbor
np hard
data analysis
computer vision