Disproves a prior quasi-linear claim for integer sparse polynomial multiplication and supplies a quasi-linear bit-complexity algorithm via modular interpolation, plus a linear-bit algorithm over finite fields.
Polynomial modular product verifica- tion and its implications.Journal of Symbolic Computation, 116:98–129, 2023
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quasi-linear Time Multiplication of Sparse Polynomials with Integer Coefficients
Disproves a prior quasi-linear claim for integer sparse polynomial multiplication and supplies a quasi-linear bit-complexity algorithm via modular interpolation, plus a linear-bit algorithm over finite fields.