Absolute polynomial factorization in two variables and the knapsack problem

  • Authors:

  • Guillaume Chèze

  • Affiliations:

  • Université de Nice Sophia Antipolis, Cedex, France

  • Venue:
  • ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X,Y), after a linear change of coordinates, is via a factorization modulo X3. This was proposed by A. Galligo and D. Rupprecht in [7],[16]. Then absolute factorization is reduced to finding the minimal zero sum relations between a set of approximated numbers b;i;, i =1 to n such that ∑n;i =1; b;i; =0, (see also [17]). Here this problem with an a priori exponential complexity, is efficiently solved for large degrees (n›100). We rely on LLL algorithm, used with a strategy of computation inspired by van Hoeij's treatment in [23]. For that purpose we prove a theorem on bounded integer relations between the numbers b;i;,, also called linear traces in [19].