原书出处
Introduction to Algorithms, Fourth Edition
14 第14章 动态规划
ing to the size of the table and the number of other table entries each entry depends on.
They call a dynamic-programming algorithm tD/eD if its table size is O(nt) and each entry depends on O(ne) other entries.
For example, the matrix-chain multiplication algorithm in Section 14.2 is 2D/1D, and the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter014.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea