Sparse polynomial interpolation: faster strategies over finite fields

DOI10.1007/S00200-024-00655-5MaRDI QIDQ6898875zbMATH OpenFDO

Authors Joris van der Hoeven, Grégoire Lecerf

Publication date 17 November 2025

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmcomplexityfast Fourier transformfinite fieldmultivariate polynomialsparse interpolation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

This page was built for publication: Sparse polynomial interpolation: faster strategies over finite fields

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