GCDHEU

MaRDI QIDQ13798swMATHFDO

Official website https://www.sciencedirect.com/science/article/pii/S0747717189800045

Described by source

• GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
• scientific article; zbMATH DE number 3936514 (Why is no real title available?)

Cited in

(12)

• Quasi-gcd computations
• 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
• MapleTensor
• Computing sparse GCD of multivariate polynomials via polynomial interpolation
• A fast parallel sparse polynomial GCD algorithm
• A deterministic algorithm for finding \(r\)-power divisors
• evalhf
• Telescopers
• In honour of Keith Geddes on his 60th birthday
• tangent Graeffe

This page was built for software: GCDHEU