Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) · HackerPapers discussions

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) — HN submission

Thu, 13 Aug 2015 00:43:23 GMT

Edit Distance Can't Be in Strongly Subquadratic Time (unless SETH Is False) [pdf]

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) — mentioned by a3_nm

Tue, 11 Aug 2015 09:57:32 GMT

The title of the Boston Globe article and of the HN submission is misleading. The article does not prove that subquadratic edit distance algorithms do not exist. It only proves it conditional to another unproven complexity hypothesis (SETH). In other words, it shows that if such algorithms exist, then faster algorithms exist for another problem (SAT for CNF formulae with certain size bounds), where we haven't been able to find them yet. See the original article http://arxiv.org/abs/1412.0348 whose title is more accurate. This is important work, of course, and provides more evidence that…

Paper and discussion history. A mention is not an endorsement.

Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false) — mentioned by dfan

Thu, 11 Jun 2015 12:19:32 GMT

Here's the paper: http://arxiv.org/abs/1412.0348

Paper and discussion history. A mention is not an endorsement.