Covanov and Thomé ( Multiplication)
Jump to navigation
Jump to search
Time Complexity
$O(n \log n {2}^{({3} \log*n)})$
Space Complexity
$O(n)$ auxiliary?? bits
(^ same as above)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
2016