Factoring sparse multivariate polynomials
Journal of Computer and System Sciences
On the complexity of sparse elimination
Journal of Complexity
Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
SIAM Journal on Numerical Analysis
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
Factoring polynomials via polytopes
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Complexity issues in bivariate polynomial factorization
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Absolute polynomial factorization in two variables and the knapsack problem
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Numerical factorization of multivariate complex polynomials
Theoretical Computer Science - Algebraic and numerical algorithm
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
Lifting and recombination techniques for absolute factorization
Journal of Complexity
From an approximate to an exact absolute polynomial factorization
Journal of Symbolic Computation
A characteristic set method for equation solving over finite fields
ACM Communications in Computer Algebra
Absolute factoring of bidegree bivariate polynomials
ACM Communications in Computer Algebra
A lifting and recombination algorithm for rational factorization of sparse polynomials
Journal of Complexity
| Hi-index | 0.00 |
This article presents an algorithmic approach to study and compute the absolute factorization of a bivariate polynomial, taking into account the geometry of its monomials. It is based on algebraic criterions inherited from algebraic interpolation and toric geometry.