Skip to content
  1. CLRS-Lean
  2. Chapters 1–35 · CLRS Fourth Edition
  3. Chapter 26. Parallel Algorithms
  4. Chapter 26 Internal Parallel-Algorithm Index
  5. 26.2. Parallel Matrix Algorithms
Browse chapters
Imports
import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMatrix.Definitions import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMatrix.Correctness import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMatrix.Costs

CLRS Section 26.2 — Parallel Matrix Algorithms

This navigation module groups the executable P-ADD and P-MATMUL definitions with their value-correctness theorems and exact execution-attached work/span equalities for dimension 2^k. The all-input asymptotic theorems concern numerical recurrence extensions, without an arbitrary-size padding/unpadding constructor.

Implementation details