Faster integer multiplication using plain vanilla FFT primes
Symbolic Computation
2017-10-17 v2 Computational Complexity
Number Theory
Abstract
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.
Keywords
Cite
@article{arxiv.1611.07144,
title = {Faster integer multiplication using plain vanilla FFT primes},
author = {David Harvey and Joris van der Hoeven},
journal= {arXiv preprint arXiv:1611.07144},
year = {2017}
}
Comments
14 pages, to appear in Mathematics of Computation