On some approximation problems concerning sparse polynomials over finite fields
- 1 May 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 157 (2) , 259-266
- https://doi.org/10.1016/0304-3975(95)00162-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Fast Construction of Irreducible Polynomials over Finite FieldsJournal of Symbolic Computation, 1994
- The complexity of sparse polynomial interpolation over finite fieldsApplicable Algebra in Engineering, Communication and Computing, 1994
- Approximating the Number of Zeroes of a GF[2] PolynomialJournal of Algorithms, 1993
- Searching for primitive roots in finite fieldsMathematics of Computation, 1992
- Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite FieldsSIAM Journal on Computing, 1990
- New algorithms for finding irreducible polynomials over finite fieldsMathematics of Computation, 1990
- Monte-Carlo approximation algorithms for enumeration problemsJournal of Algorithms, 1989