Toom-3 ( Multiplication)

From Algorithm Wiki

Revision as of 07:54, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Toom-3_(_Multiplication)&oldid=46933"