Pages that link to "Item:Q1124635"
From MaRDI portal
The following pages link to GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation (Q1124635):
Displaying 7 items.
- GCDHEU (Q13798) (← links)
- In honour of Keith Geddes on his 60th birthday (Q540321) (← links)
- Gcd of multivariate polynomials via Newton polytopes (Q545987) (← links)
- Three new algorithms for multivariate polynomial GCD (Q1194336) (← links)
- On degrees of modular common divisors and the big prime gcd algorithm (Q1751453) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- Nikolai Ivanovich Lobachevskii (on the bicentenary of his birth) (Q4300572) (← links)
