原书出处
Introduction to Algorithms, Fourth Edition
28 第28章 矩阵运算
wo n × n matrices can be multiplied in O(I(n)) time. Proof Let A and B be n × n matrices.
To compute their product C = AB, define the 3n × 3n matrix D by The inverse of D is and thus to compute the product AB, just take the upper right n × n submatrix of D−1.
Constructing matrix D takes Θ(n2) time, which is O(I(n)) from the assumption that I(n) =
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter028.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea