scientific article; zbMATH DE number 3936514
From MaRDI portal
Publication:3707405
Cited in
(10)- Quasi-gcd computations
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
- A heuristic irreducibility test for univariate polynomials
- Three new algorithms for multivariate polynomial GCD
- 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
- GCDHEU
- Computing sparse GCD of multivariate polynomials via polynomial interpolation
- A deterministic algorithm for finding \(r\)-power divisors
- In honour of Keith Geddes on his 60th birthday
- Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707405)