Absolute factoring of bidegree bivariate polynomials

Authors:
G. Chèze;M. Elkadi;A. Galligo;M. Weimann
Affiliations:
Université de Nice Sophia-Antipolis, France;INRIA-UNS;INRIA-UNS;Physical and Chemical Graduate School Göttingen
Venue:
ACM Communications in Computer Algebra
Year:
2009

Citing 4
Cited 0

Absolute polynomial factorization in two variables and the knapsack problem

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Improved dense multivariate polynomial factorization algorithms

Journal of Symbolic Computation
Towards toric absolute factorization

Journal of Symbolic Computation
From an approximate to an exact absolute polynomial factorization

Journal of Symbolic Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

We describe an efficient algorithm and an implementation for computing an absolute factorization of a bivariate polynomial with a given bidegree. Results of experimentation and an illustrative example are provided. This algorithm is a generalization of the previous one by Rupprecht-Galligo-Chèze which works after a generic change of coordinates. It relies on a general algorithmic approach based on a study of the curve defined by the polynomial to factorize in a toric surface.