Harvey; Hoeven ( Multiplication)
Jump to navigation
Jump to search
Time Complexity
$O(n \log n)$
Space Complexity
$O(n)$ auxiliary?? bits
((this one is kind of a mess to read but it seems generally the same as above - objects like polynomials/vectors and other numbers are of size O(n) and there are constantly many?))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
2019