Matrix Multiplication: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 14: | Line 14: | ||
<font color=darkgray>TODO [[CLRS]] page 75.</font> | <font color=darkgray>TODO [[CLRS]] page 75.</font> | ||
=<span id='Strassen'></span>Strassen's Algorithm for Matrix Multiplication= | |||
Revision as of 19:27, 20 September 2021
Internal
TODO
- problem statement
- naïve recursive solution
- Strassen algorithm
Overview
The asymptotic complexity is Θ(nlg7).
TODO CLRS page 75.