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

@@ Property / DOI @@
-.1016/j.ipl.2017.11.007
@@ Property / DOI: 10.1016/j.ipl.2017.11.007 / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q112162232
@@ Property / Wikidata QID: Q112162232 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2949447832
@@ Property / OpenAlex ID: W2949447832 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.01143
@@ Property / arXiv ID: 1703.01143 / rank @@
+Normal rank
@@ 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
@@ Property / DOI @@
+.1016/J.IPL.2017.11.007
@@ Property / DOI: 10.1016/J.IPL.2017.11.007 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1705641