An optimal parallel algorithm for computing a near-optimal order of matrix multiplications (Q5056129): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-55706-7_6
+Normal rank
@@ Property / OpenAlex ID @@
+W1537219300
@@ Property / OpenAlex ID: W1537219300 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
+Normal rank
@@ Property / cites work @@
+Almost fully-parallel parentheses matching
@@ Property / cites work: Almost fully-parallel parentheses matching / rank @@
+Normal rank
@@ Property / cites work @@
+An             <i>O(n)</i>             algorithm for determining a near-optimal computation order of matrix chain products
+Normal rank
@@ Property / cites work @@
+Q3798227
@@ Property / cites work: Q3798227 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
+Normal rank
@@ Property / cites work @@
+Q3992991
@@ Property / cites work: Q3992991 / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n) algorithm to find a near-optimum partition of a convex polygon
+Normal rank
@@ Property / cites work @@
+On efficient parallel computations for some dynamic programming problems
+Normal rank
@@ Property / cites work @@
+Q3197319
@@ Property / cites work: Q3197319 / rank @@
+Normal rank