An optimal algorithm with unknown time complexity for convex matrix searching (Q917275): Difference between revisions

@@ Property / cites work @@
+Geometric applications of a matrix-searching algorithm
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding all farthest neighbors in a convex polygon
+Normal rank
@@ Property / cites work @@
+Q3138931
@@ Property / cites work: Q3138931 / rank @@
+Normal rank
@@ Property / cites work @@
+Speeding up dynamic programming with applications to molecular biology
+Normal rank
@@ Property / cites work @@
+Q3138928
@@ Property / cites work: Q3138928 / rank @@
+Normal rank
@@ Property / cites work @@
+An Almost Linear Time Algorithm for Generalized Matrix Searching
+Normal rank
@@ Property / cites work @@
+Q3138930
@@ Property / cites work: Q3138930 / rank @@
+Normal rank
@@ Property / cites work @@
+Rapid dynamic programming algorithms for RNA secondary structure
+Normal rank
@@ Property / cites work @@
+Speed-Up in Dynamic Programming
@@ Property / cites work: Speed-Up in Dynamic Programming / rank @@
+Normal rank