Even faster integer multiplication
Authors:
- David HarveyDHDavid Harvey
- Joris van der HoevenJHJoris van der Hoeven
- Grégoire LecerfGLGrégoire Lecerf
- 1 October 2016
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 36, 1-30
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Fast Integer Multiplication Using Modular ArithmeticSIAM Journal on Computing, 2013
- Faster Integer MultiplicationSIAM Journal on Computing, 2009
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin OperatorSIAM Journal on Computing, 2007
- PRIMES is in PAnnals of Mathematics, 2004
- Discrete weighted transforms and large-integer arithmeticMathematics of Computation, 1994
- Parameter determination for complex number-theoretic transforms using cyclotomic polynomialsMathematics of Computation, 1989
- Almost-primes in arithmetic progressions and short intervalsMathematical Proceedings of the Cambridge Philosophical Society, 1978
- Fast Multiple-Precision Evaluation of Elementary FunctionsJournal of the ACM, 1976
- A linear filtering approach to the computation of discrete Fourier transformIEEE Transactions on Audio and Electroacoustics, 1970
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965