Hermite Normal Form Computation Using Modulo Determinant Arithmetic

1 February 1987

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research

Vol. 12 (1) , 50-59
https://doi.org/10.1287/moor.12.1.50

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.

Keywords

NORMAL FORM
FUNCTION
HERMITE
INPUT
POLYNOMIAL
STRING
MODULO DETERMINANT
DETERMINANT ARITHMETIC

All Related Versions

Version 1, RePEc (Unconfirmed version)

This publication has 0 references indexed in Scilit: