Bini's algorithm (Matrix Multiplication Matrix Product)
Jump to navigation
Jump to search
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