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.
Sparse polynomial interpolation over fields with large or zero characteristic
2 Pith papers cite this work, alongside 14 external citations. Polarity classification is still indexing.
2
Pith papers citing it
14
external citations · external index
fields
cs.SC 2verdicts
UNVERDICTED 2representative citing papers
New bound on Newton polytope support for minimal DEs in polynomial systems enables evaluation-interpolation projection algorithm outperforming prior software.
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.
-
Projecting dynamical systems via a support bound
New bound on Newton polytope support for minimal DEs in polynomial systems enables evaluation-interpolation projection algorithm outperforming prior software.