The following pages link to The EEZ-GCD algorithm (Q3890106):
Displaying 9 items.
- Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm (Q689905) (← links)
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation (Q1124635) (← links)
- Three new algorithms for multivariate polynomial GCD (Q1194336) (← links)
- A proof of the two parameter \(q\)-cases of the Macdonald-Morris constant term root system conjecture for \(S(F_ 4)\) and \(S(F_ 4)^ \vee\) via Zeilberger's method (Q1199815) (← links)
- Computing sparse GCD of multivariate polynomials via polynomial interpolation (Q1621170) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- An improved EZ-GCD algorithm for multivariate polynomials (Q2518611) (← links)
- Parallelization of triangular decompositions: techniques and implementation (Q2674015) (← links)
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings (Q6159541) (← links)
