Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over F P r

DOI10.1145/3373207.3404009MaRDI QIDQ5145994zbMATH OpenOpenAlexWikidataFDO

Authors Axel Mathieu-Mahias, Michaël Quisquater

Publication date 22 January 2021

Published in Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3373207.3404009

zbMATH Keywords

interpolationfinite fieldsmultipoint evaluationLCH-basis

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1083142
• A new approach to fast polynomial interpolation and multipoint evaluation
• Faster Algorithms for Multivariate Interpolation With Multiplicities and Simultaneous Polynomial Approximations
• Fast algorithms for multivariate interpolation and evaluation at special points
• scientific article; zbMATH DE number 7709336
• Fast evaluation and interpolation at the Chebyshev sets of points
• Algorithms – ESA 2004
• Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs
• Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
• scientific article; zbMATH DE number 5872171

Cited in

(1)

• scientific article; zbMATH DE number 7709336 (Why is no real title available?)

Describes a project that uses

Uses Software

• FLINT

This page was built for publication: Fast multipoint evaluation and interpolation of polynomials in the LCH-basis over F _P ^r

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