Covanov and Thomé ( Multiplication): Difference between revisions
Jump to navigation
Jump to search
No edit summary Tag: Reverted |
No edit summary Tag: Manual revert |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(nlogn {2}^{( | $O(nlogn {2}^{O(log*n)$}) | ||
== Space Complexity == | == Space Complexity == | ||
| Line 27: | Line 27: | ||
== Year == | == Year == | ||
2015 | |||
== Reference == | == Reference == | ||
https:// | https://hal.inria.fr/hal-01108166v1/document | ||
Revision as of 11:14, 15 February 2023
Time Complexity
$O(nlogn {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