Transcript PPT for Strassen`s Subcubic Matrix Multiplication Algorithm (22 min)

Divide and
Conquer
Design and Analysis
of Algorithms I
Matrix
Multiplication
Matrix Multiplication
Tim Roughgarden
Example (n=2)
Tim Roughgarden
What is the asymptotic running time of the straightforward
iterative algorithm for matrix multiplication?
𝜃(𝑛 log 𝑛)
𝜃(𝑛2 )
𝜃(𝑛3 )
𝜃(𝑛4 )
The Divide and Conquer Paradigm
Tim Roughgarden
Applying Divide and Conquer
Tim Roughgarden
Recursive Algorithm #1
Tim Roughgarden
Strassen’s Algorithm (1969)
Tim Roughgarden
The Details
Tim Roughgarden