Toom-3 ( Multiplication)
Revision as of 11:33, 15 February 2023 by Admin (talk | contribs) (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/journals/tran/1969-142-00/S0002-9947-1969-0249212-8/S0002-9947-1969-0249212-8.pdf")
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