An optimal lower bound on the communication complexity of gap-hamming-distance.
Amit ChakrabartiOded RegevPublished in: STOC (2011)
Keyphrases
- hamming distance
- lower bound
- worst case
- upper bound
- optimal solution
- pattern matching
- binary strings
- competitive ratio
- objective function
- np hard
- dynamic programming
- edit distance
- branch and bound algorithm
- genetic algorithm
- exhaustive search
- distance measure
- visual features
- hash functions
- data analysis
- search algorithm
- computer vision
- data sets
- binary representation