原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
ise (see Exercise 14.2-3) is to show that the solution to the recurrence (14.6) is Ω(2n).
The number of solutions is thus exponential in n, and the brute-force method of exhaustive search makes for a poor strategy when determining how to optimally parenthesize a matrix chain.
Applying dynamic programming Let’s use the dynamic-programming method to determine how to
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea