Hermite Normal Form Computation Using Modulo Determinant Arithmetic

Authors:
Publisher website
Google Scholar
Abstract
This paper describes a new class of Hermite normal form solution procedures which perform modulo determinant arithmetic throughout the computation. This class of procedures is shown to possess a polynomial time complexity bound which is a function of the length of the input string. Computational results are also given.