Revision as of 12:22, 12 April 2018 (view source) Eoraptor (talk \| contribs) mNo edit summary ← Older edit		Revision as of 12:23, 12 April 2018 (view source) Eoraptor (talk \| contribs) m (→‎Python) Newer edit →
Line 28: __TOC__ == Python == ~~Will~~We will solve the task in three steps: 1) Enumerate all ways to parenthesize (in a recursive generator), and for each one compute the cost. Then simply look up the minimal cost.

Matrix chain multiplication: Difference between revisions

Matrix chain multiplication (view source)