Applying Coding Theory to Sparse Interpolation

DOI10.1137/0222046zbMath0807.11056OpenAlexW2069060940MaRDI QIDQ3137705

No author found.

Publication date: 10 October 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222046

zbMATH Keywords

interpolationReed-Muller codesfinite fieldReed-Solomon codesBoolean polynomialsfast interpolation algorithmssparse multivariate polynomialslinear sums of characters

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Number-theoretic algorithms; complexity (11Y16) Finite fields (field-theoretic aspects) (12E20) Arithmetic theory of polynomial rings over finite fields (11T55) Semigroups (20M99)

Related Items (2)

Almost optimal proper learning and testing polynomials ⋮ The complexity of sparse polynomial interpolation over finite fields

This page was built for publication: Applying Coding Theory to Sparse Interpolation