Schonhage's algorithm (Matrix Multiplication Matrix Product)
Jump to navigation
Jump to search
Time Complexity
$O(n^{({3}*\log {52}/l \og {110})}) ~ O(n^{2.{521}8})$
Space Complexity
$O(n^{2})$ words
(Derived: Same idea as Strassen's, plus three additional nxn matrices)
Description
Approximate?
Approximate
Approximation Factor: ?
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1980