On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields
- 29 July 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 84 (2) , 151-164
- https://doi.org/10.1016/0304-3975(91)90157-w
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Queries and concept learningMachine Learning, 1988
- Discrete logarithms inGF(p)Algorithmica, 1986
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line ProgramsJournal of the ACM, 1983
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980