Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4945947 | Journal of Symbolic Computation | 2017 | 35 Pages |
Abstract
We present a variation of the modular algorithm for computing the Hermite normal form of an OK-module presented by Cohen (1996), where OK is the ring of integers of a number field K. An approach presented in Cohen (1996) based on reductions modulo ideals was conjectured to run in polynomial time by Cohen, but so far, no such proof was available in the literature. In this paper, we present a modification of the approach of Cohen (1996) to prevent the coefficient swell and we rigorously assess its complexity with respect to the size of the input and the invariants of the field K.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Jean-François Biasse, Claus Fieker, Tommy Hofmann,