1. CLRS-Lean
  2. CLRS Fourth Edition
  3. Chapter 26. Parallel Algorithms
  4. 26.2-26.3. Multithreaded Algorithms (Historical 2_4 Compatibility)
  5. 26.2. Parallel Matrix Algorithms
  6. 26.2. Parallel Matrix Algorithms — Cost Analysis
Imports
import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMatrix.Costs.Definitions import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMatrix.Costs.ExecutionEqualities import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMatrix.Costs.Monotonicity import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMatrix.Costs.PowerBounds import CLRSLean.FourthEdition.Chapter_26.Section_26_2_4_Algorithms.ParallelMatrix.Costs.AllInputBounds

CLRS Section 26.2 — Matrix Execution Cost Analysis

This navigation module groups the exact work/span recurrences for executable P-ADD and P-MATMUL with the theorems connecting those recurrences to the costs carried by their Costed results, their power-of-two solutions, and the all-input asymptotic main theorems.

Implementation details