Matrix Multiplication: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m (Ovidiu moved page Strassen's Algorithm for Matrix Multiplication to Matrix Multiplication without leaving a redirect) |
(No difference)
| |
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.