Covanov and Thomé ( Multiplication)

From Algorithm Wiki

Revision as of 11:14, 15 February 2023 by Admin (talk | contribs)

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

Jump to navigation Jump to search

Time Complexity

$O(nlogn {2}^{O(log*n)$})

Space Complexity

$O(n)$ auxiliary?? bits

(^ same as above)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

2015

Reference

https://hal.inria.fr/hal-01108166v1/document

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