Polynomial GCD and Factorization via Approximate Gröbner Bases
Daniel Lichtblau · 2010
We discuss computation of approximate Gröbner bases at finite precision. We show how this can be used to deduce exact results for polynomial greatest common divisors and factorization. In particular we indicate an algorithm for factoring multivariate polynomials over the closure algebraic of the rationals.