原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
7). As we did with P-MATRIX-MULTIPLY-RECURSIVE, we can devise a recurrence for the span.
In this case, seven recursive calls execute in parallel, but since they all operate on matrices of the same size, we obtain the same recurrence (26.6) as we did for P-MATRIX-MULTIPLY-RECURSIVE, with solution Θ(lg2 n).
Thus the parallel version of Strassen’s method has parallelism Θ(nlg 7/lg2 n), which is l
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea