The complexity of sparse polynomial interpolation over finite fields
- 1 March 1994
- journal article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 5 (2) , 91-103
- https://doi.org/10.1007/bf01438278
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Boolean circuit complexity of algebraic interpolation problemsPublished by Springer Nature ,2005
- Applying Coding Theory to Sparse InterpolationSIAM Journal on Computing, 1993
- On zero-testing and interpolation of k-sparse multivariate polynomials over finite fieldsTheoretical Computer Science, 1991
- Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$SIAM Journal on Computing, 1991
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite FieldsSIAM Journal on Computing, 1990
- Interpolating polynomials from their valuesJournal of Symbolic Computation, 1990