Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, October 24, 2017, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Thomas Dueholm Hansen (Aarhus University)
Backurs and Indyk (STOC'15) recently proved that the Edit Distance of two sequences of equal length cannot be computed in strongly subquadratic time under the Strong Exponential Time Hypothesis (SETH). The result was extended by follow-up works to similar problems such as finding the Longest Common Subsequence (LCS).
SETH is a very strong assumption: it asserts that even linear size CNF formulas cannot be analyzed for satisfiability with an exponential speedup over exhaustive search. We consider much safer assumptions, e.g. that such a speedup is impossible for SAT on much more expressive representations, like subexponential-size NC circuits.
Our main result is a reduction from SAT on Branching Programs to fundamental problems like Edit Distance and LCS. Truly subquadratic algorithms for these problems therefore have consequences that we consider to be far more remarkable than merely faster CNF SAT algorithms. An interesting feature of our work is that even mildly subquadratic algorithms imply new circuit lower bounds. For example, we show that if we can shave an arbitrarily large polylog factor from the complexity of Edit Distance then NEXP does not have non-uniform NC^1 circuits.
Joint work with Amir Abboud, Virginia Vassilevska Williams, and Ryan Williams.
Automatic MiSe System Software Version 1.4803M | admin login