原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
r of scalar multiplications. The input is the sequence of dimensions 〈p0, p1, p2, …, pn〉.
The matrix-chain multiplication problem does not entail actually multiplying matrices.
The goal is only to determine an order for multiplying matrices that has the lowest cost.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea