The algorithm of Pottier (see [Pot94]) starts by computing a lattice
basis
for the integer kernel of using the
LLL-algorithm. The ideal corresponding to the lattice basis vectors
is saturated - as in the algorithm of Conti and Traverso - by
inversion of all variables: One adds an auxiliary variable and the
generator
to obtain an ideal
in
from which one computes by elimination of
.
User manual for Singular version 3-0-1, October 2005,
generated by texi2html.