activity
20092026
most citedOn the computation of the HNF of a module over the ring of integers of a number field

13 citations · 27 across the 12 of their papers we have counts for

collaborators
Showing 2012 · cs.SCShow all

1 paper · 2 filters

cs.SC2012

A polynomial time algorithm for computing the HNF of a module over the integers of a number field

Jean-François Biasse, Claus Fieker

We present a variation of the modular algorithm for computing the Hermite Normal Form of an $\OK$-module presented by Cohen, where $\OK$ is the ring of integers of a number field K…