Gcd of multivariate polynomials via Newton polytopes

DOI10.1016/J.AMC.2011.03.035zbMATH Open1264.12010OpenAlexW2057967145MaRDI QIDQ545987FDOQ545987

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

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

zbMATH Keywords

Newton polytopegreatest common divisormultivariate polynomial

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Absolute irreducibility of polynomials via Newton polytopes
• Modern computer algebra
• Factoring polynomials via polytopes
• Decomposition of polytopes and polynomials
• Flexible object hierarchies in polymake. (Extended abstract)

Cited In (3)

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

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)