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 X^3. This was proposed by A. Galligo and
D. Rupprecht. Then absolute factorization is reduced to finding
the minimal zero sum relations between a set of approximated numbers
b_i, i=1 to n. Here this problem with an a priori exponential
complexity, is efficiently solved for large degrees (n>100). We rely
on L.L.L. algorithm. For that purpose we prove a theorem on
bounded integer relations between the numbers b_i, also called
linear traces.
