Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made.
Amir AbboudThomas Dueholm HansenVirginia Vassilevska WilliamsRyan WilliamsPublished in: STOC (2016)
Keyphrases
- edit distance
- lower bound
- lower bounding
- upper bound
- edit operations
- string matching
- graph matching
- similarity measure
- branch and bound algorithm
- approximate string matching
- lower and upper bounds
- distance function
- graph edit distance
- distance measure
- dynamic programming
- dynamic time warping
- tree structured data
- levenshtein distance
- string similarity
- optimal solution
- approximate matching
- data sets
- distance computation
- triangle inequality
- np hard
- subgraph isomorphism
- object recognition
- tree edit distance
- string edit distance
- worst case
- neural network