Corpus ID: 4857806

# Fast integer multiplication using generalized Fermat primes

@article{Covanov2015FastIM,
title={Fast integer multiplication using generalized Fermat primes},
author={S. Covanov and Emmanuel Thom{\'e}},
journal={arXiv: Symbolic Computation},
year={2015}
}
• Published 2015
• Mathematics
• arXiv: Symbolic Computation
For almost 35 years, Sch{\"o}nhage-Strassen's algorithm has been the fastest algorithm known for multiplying integers, with a time complexity O(n $\times$ log n $\times$ log log n) for multiplying n-bit inputs. In 2007, F{\"u}rer proved that there exists K > 1 and an algorithm performing this operation in O(n $\times$ log n $\times$ K log n). Recent work by Harvey, van der Hoeven, and Lecerf showed that this complexity estimate can be improved in order to get K = 8, and conjecturally K = 4… Expand
11 Citations

#### Tables from this paper

Faster integer multiplication using plain vanilla FFT primes
• Mathematics, Computer Science
• Math. Comput.
• 2019
Big Prime Field FFT on Multi-core Processors
• Computer Science, Mathematics
• ISSAC
• 2019
On The Hardness of Approximate and Exact (Bichromatic) Maximum Inner Product
• Lijie Chen
• Computer Science, Mathematics
• Electron. Colloquium Comput. Complex.
• 2018
Parallel Integer Polynomial Multiplication
• Computer Science, Mathematics
• 2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
• 2016

#### References

SHOWING 1-10 OF 36 REFERENCES