60 citations · 106 across the 16 of their papers we have counts for
Showing 2016 · math.NTShow all
2 papers · 2 filters
math.NT2016★ 13 cited
On the computation of the HNF of a module over the ring of integers of a number field
Jean-François Biasse, Claus Fieker, Tommy Hofmann
We present a variation of the modular algorithm for computing the Hermite normal form of an -module presented by Cohen, where is the ring of integers o…
math.NT2016★ 3 cited
Computing in quotients of rings of integers
Tommy Hofmann, Claus Fieker
We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In additio…