Factoring bivariate polynomials with integer coefficients via Newton polygons

DOI10.2298/FIL1302215CMaRDI QIDQ5259444zbMATH OpenOpenAlexFDO

Authors Ivan Pavkov, Siniša Crvenković

Publication date 26 June 2015

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/fil1302215c

zbMATH Keywords

bivariate polynomialsNewton polygonnon-trivial factorization

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05)

Recommendations

• Integral polytopes and polynomial factorization
• Absolute irreducibility of bivariate polynomials via polytope method
• scientific article; zbMATH DE number 800174
• Factoring polynomials via polytopes
• On the irreducible factors of a polynomial. II.

Cited in

(2)

• scientific article; zbMATH DE number 800174 (Why is no real title available?)
• An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes

This page was built for publication: Factoring bivariate polynomials with integer coefficients via Newton polygons

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