scientific article; zbMATH DE number 1309684

MaRDI QIDQ4254152zbMATH OpenFDO

Authors K. E. Barrett

Publication date 19 June 2000

zbMATH Keywords

degenerate bivariate polynomialslinear factorsrecursive algorithmreducibility

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Review text

A recursive algorithm for determining the \(1 \over {2(n-1)n}\) constraints for a bivariate polynomial to be reducible is presented (though the inductive proof of correctness is omitted). This algorithm generalizes the constraints for a quadratic in two variables to be factorable. Also presented are explicit formulae for computing the coefficients of the degree \(k-1\) factor of a degree \(k\) polynomial (assuming the polynomial has a linear factor). These formulae require two one-variable polynomials of degree \(k\) to be solved.

Recommendations

• scientific article; zbMATH DE number 800174
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• On Bivariate Polynomial Factorization over Finite Fields
• scientific article; zbMATH DE number 38433
• Irreducibility of multivariate polynomials

This page was built for publication:

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