Factoring bivariate polynomials with integer coefficients via Newton polygons

DOI10.2298/FIL1302215CzbMATH Open1458.13027OpenAlexW2162117487MaRDI QIDQ5259444FDOQ5259444

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

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.

zbMATH Keywords

Newton polygonbivariate polynomialsnon-trivial factorization

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05)

Cited In (2)

• An application of bivariate polynomial factorization on decoding of Reed-Solomon based codes
• Title not available (Why is that?)

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)