Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields
- 1 December 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (6) , 1059-1063
- https://doi.org/10.1137/0219073
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On zero-testing and interpolation of k-sparse multivariate polynomials over finite fieldsTheoretical Computer Science, 1991
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Parallel Algorithms for Algebraic ProblemsSIAM Journal on Computing, 1984
- Computing in Algebraic ExtensionsPublished by Springer Nature ,1983
- A universal interconnection pattern for parallel computersJournal of the ACM, 1982
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- Probabilistic algorithms for sparse polynomialsPublished by Springer Nature ,1979
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970