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

DOI10.1145/2442829.2442844zbMath1323.11099arXiv1204.1298OpenAlexW2148367244WikidataQ130992883 ScholiaQ130992883MaRDI QIDQ5244519

Jean-François Biasse, Claus Fieker

Publication date: 27 March 2015

Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.1298

zbMATH Keywords

modulescomplexityHermite normal formnumber theory

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Related Items (2)

On the computation of the HNF of a module over the ring of integers of a number field ⋮ Computing in quotients of rings of integers

This page was built for publication: A polynomial time algorithm for computing the HNF of a module over the integers of a number field