Covanov and Thomé ( Multiplication)

From Algorithm Wiki

Revision as of 10:38, 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}^{({3}log*n)$})

Space Complexity

$O(n)$ auxiliary?? bits

(^ same as above)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

2016

Reference

https://arxiv.org/abs/1502.02800

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