Toom-3 ( Multiplication): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{1.{4}6})$ == Space Complexity == $O(n)$ auxiliary bits (Re-use space across recursive subcalls (to obtain the recursion S(n) = S(n/3)+O(n))) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1969 == Reference == https://www-ams-org.ezproxy.canberra.edu.au/journals/tran/1969-142-00/S0002-9947-1969-0249212-8/S0002-9947-1969-0249212-8.pdf") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n)$ | $O(n)$ bits | ||
(Re-use space across recursive subcalls (to obtain the recursion S(n) = S(n/3)+O(n))) | (Re-use space across recursive subcalls (to obtain the recursion S(n) = S(n/3)+O(n))) | ||
Latest revision as of 07:54, 10 April 2023
Time Complexity
$O(n^{1.{4}6})$
Space Complexity
$O(n)$ bits
(Re-use space across recursive subcalls (to obtain the recursion S(n) = S(n/3)+O(n)))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1969