原书出处
Introduction to Algorithms, Fourth Edition
4 第4章 分治策略
trices, although large matrices tend to be sparse, and sparse methods can be much faster.
When using limited-precision floating-point values, Strassen’s algorithm produces larger numerical errors than the Θ(n3) algorithms do, although Higham [215] demonstrated that Strassen’s algorithm is amply accurate for some applications.
Recurrences were studied as early as 1202 by Leonardo Bonacci [66], also known as Fibonac
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter004.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea