Irreducibility and greatest common divisor algorithms for sparse polynomials

DOI10.1017/CBO9780511721274.012zbMath1270.11129OpenAlexW2488464333MaRDI QIDQ3166375

Andrew Granville, Michael Filaseta, Andrzej Schinzel

Publication date: 11 October 2012

Published in: Number Theory and Polynomials (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/cbo9780511721274.012

zbMATH Keywords

algorithmsheightirreducibilitygreatest common divisors of univariate polynomials

Mathematics Subject Classification ID

Related Items (7)

Computing the torsion points of a variety defined by lacunary polynomials ⋮ Unlikely intersections and multiple roots of sparse polynomials ⋮ Computing the multilinear factors of lacunary polynomials without heights ⋮ Efficient algorithms for sparse cyclotomic integer zero testing ⋮ Factorization of bivariate sparse polynomials ⋮ Unnamed Item ⋮ Overdetermined systems of sparse polynomial equations

This page was built for publication: Irreducibility and greatest common divisor algorithms for sparse polynomials