Gcd of multivariate polynomials via Newton polytopes

DOI10.1016/J.AMC.2011.03.035MaRDI QIDQ545987zbMATH OpenOpenAlexFDO

Authors Luiz Emilio Allem, Vilmar Trevisan

Publication date 24 June 2011

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2011.03.035

zbMATH Keywords

Newton polytopegreatest common divisormultivariate polynomial

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials, factorization in commutative rings (13P05)

Recommendations

• Resultants and coprimeness of polynomials
• Three new algorithms for multivariate polynomial GCD
• Factoring polynomials via polytopes
• GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
• Greatest common divisors of polynomials given by straight-line programs

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 236540 (Why is no real title available?)
• scientific article; zbMATH DE number 960150 (Why is no real title available?)
• Absolute irreducibility of polynomials via Newton polytopes
• Decomposition of polytopes and polynomials
• Factoring polynomials via polytopes
• Flexible object hierarchies in polymake. (Extended abstract)
• Modern computer algebra

Cited in

(3)

• Resultants and coprimeness of polynomials
• Decomposition of polytopes and polynomials
• Approximate GCD of multivariate polynomials

Describes a project that uses

Uses Software

• polymake

This page was built for publication: Gcd of multivariate polynomials via Newton polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545987)