Faster integer multiplication using plain vanilla FFT primes

11/22/2016

∙

by   David Harvey, et al.

∙

0

∙

share

Assuming a conjectural upper bound for the least prime in an arithmetic progression, we show that n-bit integers may be multiplied in O(n log n 4^(log^* n)) bit operations.