Matrix Multiplication

From NovaOrdis Knowledge Base

Revision as of 17:12, 20 September 2021 by Ovidiu (talk | contribs) (→‎Internal)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Internal

Algorithms | Divide and Conquer

Overview

The asymptotic complexity is Θ(n^lg7).

TODO CLRS page 75.

Retrieved from "https://kb.novaordis.com/index.php?title=Matrix_Multiplication&oldid=81150"