An <i>O(n)</i> algorithm for determining a near-optimal computation order of matrix chain products (Q4156871)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An O(n) algorithm for determining a near-optimal computation order of matrix chain products |
scientific article; zbMATH DE number 3587168
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O(n)</i> algorithm for determining a near-optimal computation order of matrix chain products |
scientific article; zbMATH DE number 3587168 |
Statements
An <i>O(n)</i> algorithm for determining a near-optimal computation order of matrix chain products (English)
0 references
1978
0 references
