Harvey; Hoeven; Lecerf ( Multiplication)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

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

Space Complexity

$O(n)$ auxiliary?? bits

(^ same as above)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

2018

Reference

https://arxiv.org/abs/1802.07932