Factoring bivariate sparse (lacunary) polynomials
Idioma
en
Article de revue
Este ítem está publicado en
Journal of Complexity. 2007, vol. 23, p. 193-216
Elsevier
Resumen en inglés
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their multiplicities, whose running time is polynomial ...Leer más >