Matrix chain multiplication: Difference between revisions
m
no edit summary
(Created page with "{{draft task|Discrete math}} ;Problem Using the most straightfoward algorithm (which we assume here), computing the product of two matrices of dimen...") |
mNo edit summary |
||
Line 24:
To solve the task, it's possible, but not required, to write a function that enumerates all possible ways to parenthesize the product. This task is a classic example of [[:wp:Dynamic programming|dynamic programming]].
__TOC__
| |||