Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 14-17-June-2015, Issue , 2015, Pages 51-58

  Backurs, Arturs ^a   Indyk, Piotr ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Conditional lower bounds; Edit distance; Pattern matching; SETH

Indexed keywords

DYNAMIC PROGRAMMING; PATTERN MATCHING;

COMPUTATIONAL TASK; CONJUNCTIVE NORMAL FORMS; EDIT DISTANCE; LEVENSHTEIN DISTANCE; LOWER BOUNDS; SATISFIABILITY; SETH; STRONG EXPONENTIAL TIME HYPOTHESIS;

COMPUTATION THEORY;

EID: 84958251714     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2746539.2746612     Document Type: Conference Paper

References (13)

1. Amir Abboud, Arturs Backurs, and Virginia Vassilevska Williams. Quadratic-time hardness of lcs and other sequence similarity measures. arXiv preprint arXiv:1501.07053, 2015.
2. Alexandr Andoni, Robert Krauthgamer, and Krzysztof Onak. Polylogarithmic approximation for edit distance and the asymmetric query complexity. In FOCS, pages 377-386. IEEE, 2010.
3. A. Abboud and V. Vassilevska Williams. Popular conjectures imply strong lower bounds for dynamic problems. FOCS, 2014.
4. Amir Abboud, V. Vassilevska Williams, and Oren Weimann. Consequences of faster sequence alignment. ICALP, 2014.
5. Karl Bringmann and Marvin Kunnemann. Quadratic conditional lower bounds for string problems and dynamic time warping. arXiv preprint arXiv:1502.01063, 2015.
6. Karl Bringmann. Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless seth fails. FOCS, 2014.
7. Russell Impagliazzo and Ramamohan Paturi. On the complexity of k-sat. Journal of Computer and System Sciences, 62(2):367-375, 2001.
8. Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity? Journal of Computer and System Sciences, 63:512-530, 2001.
9. William J Masek and Michael S Paterson. A faster algorithm computing string edit distances. Journal of Computer and System sciences, 20(1):18-31, 1980.
10. Gonzalo Navarro. A guided tour to approximate string matching. ACM computing surveys (CSUR), 33(1):31-88, 2001.
11. M. Patrascu and R. Williams. On the possibility of faster sat algorithms. SODA, 2010.
12. L. Roditty and V. Vassilevska Williams. Fast approximation algorithms for the diameter and radius of sparse graphs. STOC, 2013.
13. Ryan Williams. A new algorithm for optimal 2-constraint satisfaction and its implications. Theoretical Computer Science, 348(2):357-365, 2005.