Triangular bases of integral closures

The algorithm MaxMin, presented in this paper, computes triangular bases of fractional ideals of OL. The theoretical complexity is equivalent to current state of the art methods and in practice is almost always faster. It is also considerably faster than the routines found in standard computer algebra systems, excepting some cases involving very small field extensions.