Furer's algorithm ( Multiplication): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(nlogn {2}^{O(log*n)$}) == Space Complexity == $O(n)$ auxiliary? bits (Depends on DFT/FFT algorithm (though original source describes its own algorithm)? but all vectors/numbers are of size O(n) and there are a constant number of such objects) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 2007 == Reference == https://web.archive.org/web/201304...") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n \log n {2}^{O(\log*n)})$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:55, 10 April 2023
Time Complexity
$O(n \log n {2}^{O(\log*n)})$
Space Complexity
$O(n)$ auxiliary? bits
(Depends on DFT/FFT algorithm (though original source describes its own algorithm)? but all vectors/numbers are of size O(n) and there are a constant number of such objects)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
2007
Reference
https://web.archive.org/web/20130425232048/http://www.cse.psu.edu/~furer/Papers/mult.pdf