Sorting can exponentially speed up pure dynamic programming (Q783692): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3015963488
@@ Property / OpenAlex ID: W3015963488 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.12838
@@ Property / arXiv ID: 2012.12838 / rank @@
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+The steiner problem in graphs
@@ Property / cites work: The steiner problem in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Subtraction-free complexity, cluster transformations, and spanning trees
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Some Exact Complexity Results for Straight-Line Computations over Semirings
+Normal rank
@@ Property / cites work @@
+Greedy can beat pure dynamic programming
@@ Property / cites work: Greedy can beat pure dynamic programming / rank @@
+Normal rank
@@ Property / cites work @@
+Q5654074
@@ Property / cites work: Q5654074 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on practical construction of maximum bandwidth paths.
+Normal rank
@@ Property / cites work @@
+Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
+Normal rank
@@ Property / cites work @@
+A Theorem on Boolean Matrices
@@ Property / cites work: A Theorem on Boolean Matrices / rank @@
+Normal rank