Probabilistic algorithms for sparse polynomials
Richard E. Zippel · Lecture notes in computer science · 1979
Cited by 1,101 works. doi:10.1007/3-540-09519-5_73
Authors
References
- A Fast Monte-Carlo Test for Primality
- Algorithms and Complexity: New Directions and Recent Results
- On Hensel factorization, I
- Probabilistic algorithms for sparse polynomials
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- The Hensel lemma in algebraic manipulation
- Multivariate Polynomial Factorization
- An Improved Multivariate Polynomial Factoring Algorithm
- Factoring multivariate polynomials over the integers
- The EZ GCD algorithm