Matrix Multiplication: Difference between revisions
Jump to navigation
Jump to search
| Line 1: | Line 1: | ||
=Internal= | =Internal= | ||
* [[Algorithms#X4slMN|Algorithms | Divide and Conquer]] | * [[Algorithms#X4slMN|Algorithms | Divide and Conquer]] | ||
=TODO= | |||
<font color=darkkhaki> | |||
* problem statement | |||
* naïve recursive solution | |||
* Strassen algorithm | |||
</font> | |||
=Overview= | =Overview= | ||
Revision as of 17:39, 20 September 2021
Internal
TODO
- problem statement
- naïve recursive solution
- Strassen algorithm
Overview
The asymptotic complexity is Θ(nlg7).
TODO CLRS page 75.