Karatsuba Algorithm ( Multiplication)
Revision as of 11:33, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{1.{5}8})$ == Space Complexity == $O(n)$ auxiliary bits (Re-use space across recursive subcalls (to obtain the recursion S(n) = S(n/2)+O(n))) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1962 == Reference == http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=dan&paperid=26729&option_lang=eng")
Time Complexity
$O(n^{1.{5}8})$
Space Complexity
$O(n)$ auxiliary bits
(Re-use space across recursive subcalls (to obtain the recursion S(n) = S(n/2)+O(n)))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1962
Reference
http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=dan&paperid=26729&option_lang=eng