Why is it hard to beat \(O(n^2)\) for longest common weakly increasing subsequence? (Q1705641): Difference between revisions

@@ Property / cites work @@
+A faster algorithm computing string edit distances
+Normal rank
@@ Property / cites work @@
+A fast algorithm for computing a longest common increasing subsequence
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing a longest common increasing subsequence
+Normal rank
@@ Property / cites work @@
+Faster algorithms for computing longest common increasing subsequences
+Normal rank
@@ Property / cites work @@
+A linear algorithm for 3-letter longest common weakly increasing subsequence
+Normal rank
@@ Property / cites work @@
+Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
+Normal rank
@@ Property / cites work @@
+Q5111874
@@ Property / cites work: Q5111874 / rank @@
+Normal rank
@@ Property / cites work @@
+Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank