ghensel.spad line 1 [edit on github]
This package is used for factorization of bivariate polynomials over a finite field and univariate polynomials with integer coefficients.
HenselLift(pol, lfacts, prime, bound) lifts lfacts, that are the factors of pol mod prime, to factors of pol mod prime^k > bound. No recombining is done .
completeHensel(pol, lfact, prime, bound) lifts lfact, the factorization mod prime of pol, to the factorization mod prime^k>bound. Factors are recombined on the way.
reduction(u, pol) computes the symmetric reduction of u mod pol