2000 character limit reached
Faster integer multiplication using plain vanilla FFT primes
Published 22 Nov 2016 in cs.SC, cs.CC, and math.NT | (1611.07144v2)
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 4log* n) bit operations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
