原书出处
Introduction to Algorithms, Fourth Edition
26 第26章 并行算法
es, along with other information that does not change over the course of the computation.
The pattern of neighboring entries does not change during the computation and is called a stencil. For example, Section 14.4 presents a stencil algorithm to compute a longest common subsequence, where the value in entry c[i, j]
depends only on the values in c[i − 1, j], c[i, j − 1], and c[i − 1, j − 1], as well as t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter026.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea