Fast and simple modular interpolation using factorial representation

DOI10.4169/AMER.MATH.MONTHLY.123.5.471MaRDI QIDQ4576122zbMATH OpenOpenAlexWikidataFDO

Authors Gary L. Mullen, Daniel Panario, David Thomson

Publication date 12 July 2018

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4169/amer.math.monthly.123.5.471

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Recommendations

• Polynomial interpolation over the residue rings Z_n
• scientific article; zbMATH DE number 799768
• Polynomial functions over finite commutative rings
• Faster sparse multivariate polynomial interpolation of straight-line programs
• Fast polynomial factorization and modular composition

Cites work

• An overview of the sparse basic linear algebra subprograms
• Congruence preservation and polynomial functions from \(\mathbb{Z}_n\) to \(\mathbb{Z}_m\)
• How to share a secret
• Modern computer algebra
• On polynomial functions (mod m)
• On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\)
• On polynomial functions from \(\mathbb{Z}_{n_ 1}\times \mathbb{Z}_{n_ 2}\times \cdots \times \mathbb{Z}_{n_ r}\) to \(\mathbb{Z}_ m\)
• Polynomial functions (mod m)

Describes a project that uses

Uses Software

• BLAS
• NTL

This page was built for publication: Fast and simple modular interpolation using factorial representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576122)