Covanov and Thomé ( Multiplication): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tag: Manual revert |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n \log n {2}^{O(\log*n)})$ | ||
== Space Complexity == | == Space Complexity == | ||
Revision as of 07:55, 10 April 2023
Time Complexity
$O(n \log n {2}^{O(\log*n)})$
Space Complexity
$O(n)$ auxiliary?? bits
(^ same as above)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
2015