Matrix Multiplication

From NovaOrdis Knowledge Base
Revision as of 19:27, 20 September 2021 by Ovidiu (talk | contribs)
Jump to navigation Jump to search

Internal

TODO

  • problem statement
  • naïve recursive solution
  • Strassen algorithm

Overview

The asymptotic complexity is Θ(nlg7).


TODO CLRS page 75.

Strassen's Algorithm for Matrix Multiplication