GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
Bruce W. Char, Keith O. Geddes, Gastón H. Gonnet · Springer eBooks · 2005
Cited by 19 works. doi:10.1007/bfb0032851
Authors
References
- The Design and Analysis of Computer Algorithms
- Probabilistic algorithms for sparse polynomials
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- The EZ GCD algorithm
- Some Useful Bounds
- The Subresultant PRS Algorithm
- Factoring sparse multivariate polynomials
- The EEZ-GCD algorithm
- Non-modular computation of polynomial GCDS using trial division