Harvey; Hoeven; Lecerf ( Multiplication)
Revision as of 11:38, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(nlogn {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 == 2015 == Reference == https://arxiv.org/abs/1407.3360")
Time Complexity
$O(nlogn {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
2015