Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made
Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams · 2016
A recent, active line of work achieves tight lower bounds for fundamental problems under the Strong Exponential Time Hypothesis (SETH). A celebrated result of Backurs and Indyk (STOC’15) proves that computing the Edit Distance of two sequences of length n in truly subquadratic O(n2−ε) time, for some ε>0, is impossible under SETH. The result was extended by follow-up works to simpler looking problems like finding the Longest Common Subsequence (LCS).