A note on the hermite basis computation of large integer matrices
Ulrich Vollmer · 2003
A new algorithm is given and analyzed for the computation of the Hermite basis of a large integer matrix whose HNF has small essential part. The algorithm improves the results from [3] by dropping two key requirements on the matrix considered---sparsity and small kernel dimension---at the cost of relying on small determinant size.