GCDHEU

swMATH1054MaRDI QIDQ13798FDOQ13798

Author name not available (Why is that?)

Described by source

• GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
• Unnamed Publication

Cited In (8)

• In honour of Keith Geddes on his 60th birthday
• Computing sparse GCD of multivariate polynomials via polynomial interpolation
• A fast parallel sparse polynomial GCD algorithm
• 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
• Quasi-gcd computations
• A heuristic irreducibility test for univariate polynomials
• Three new algorithms for multivariate polynomial GCD
• A deterministic algorithm for finding \(r\)-power divisors

This page was built for software: GCDHEU