Bini's algorithm (Matrix Multiplication Matrix Product)
Revision as of 10:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2.{779}9})$ == Space Complexity == $O(n^{2})$ words (Derived: Same idea as Strassen's, plus three additional nxn matrices) == Description == == Approximate? == Approximate Approximation Factor: $O(n logn)$ error == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1979 == Reference == https://doi.org/10.1016/0020-0190(79)90113-3")
Time Complexity
$O(n^{2.{779}9})$
Space Complexity
$O(n^{2})$ words
(Derived: Same idea as Strassen's, plus three additional nxn matrices)
Description
Approximate?
Approximate
Approximation Factor: $O(n logn)$ error
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1979