The following pages link to GCDHEU (Q13798):
Displaying 8 items.
- In honour of Keith Geddes on his 60th birthday (Q540321) (← links)
- Quasi-gcd computations (Q1071503) (← links)
- A heuristic irreducibility test for univariate polynomials (Q1186702) (← 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)
- A deterministic algorithm for finding \(r\)-power divisors (Q2093686) (← links)
