Faster Integer Multiplication Using Preprocessing
Data Structures and Algorithms
2019-12-12 v2 Computational Complexity
Discrete Mathematics
Number Theory
Abstract
A New Number Theoretic Transform(NTT), which is a form of FFT, is introduced, that is faster than FFTs. Also, a multiplication algorithm is introduced that uses this to perform integer multiplication faster than O(n log n). It uses preprocessing to achieve an upper bounds of (n log n/(log log n/ log log log n). Also, we explore the possibility of O(n) time multiplication via NTTs that require only O(n) operations, using preprocessing.
Keywords
Cite
@article{arxiv.1911.07124,
title = {Faster Integer Multiplication Using Preprocessing},
author = {Matt Groff},
journal= {arXiv preprint arXiv:1911.07124},
year = {2019}
}
Comments
9 pages, 3 figures