Faster integer multiplication using plain vanilla FFT primes
classification
💻 cs.SC
cs.CCmath.NT
keywords
arithmeticassumingboundconjecturalfasterintegerintegersleast
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.