Toom-3 ( Multiplication)
Jump to navigation
Jump to search
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