Quadratic-Time Hardness of LCS and other Sequence Similarity Measures — mentioned by zzazzdsa

Wed, 29 Mar 2017 08:37:21 GMT

Unless my understanding of things is wrong, I'm pretty sure that unless the strong exponential time hypothesis (essentially, n variable CNF-SAT takes O(2^n) time in the worst case) is false, no diff algorithm can run in subquadratic time. If you could, then you would be able to solve longest common subsequence in subquadatic time, and that in turn implies SETH being false by https://arxiv.org/abs/1501.07053 . I'm pretty sure exact diff in subquadratic time is therefore impossible. It's still a nice heuristic though.

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

Quadratic-Time Hardness of LCS and other Sequence Similarity Measures · HackerPapers discussions

Quadratic-Time Hardness of LCS and other Sequence Similarity Measures — mentioned by zzazzdsa