Karatsuba Algorithm ( Multiplication): Difference between revisions
Jump to navigation
Jump to search
(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") |
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/2)+O(n))) | (Re-use space across recursive subcalls (to obtain the recursion S(n) = S(n/2)+O(n))) | ||
Latest revision as of 07:54, 10 April 2023
Time Complexity
$O(n^{1.{5}8})$
Space Complexity
$O(n)$ 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