Computing in quotients of rings of integers

DOI10.1112/S1461157014000291zbMath1369.11104arXiv1612.09176MaRDI QIDQ2878847

Tommy Hofmann, Claus Fieker

Publication date: 5 September 2014

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

polynomial algorithmsEuclidean ringsfundamental ring operations

Mathematics Subject Classification ID

Algebraic number theory computations (11Y40) Software, source code, etc. for problems pertaining to number theory (11-04) Euclidean rings and generalizations (13F07)

Related Items (2)

Computing isomorphisms between lattices ⋮ Efficient Gröbner bases computation over principal ideal rings

Cites Work

• Topics in computational algebraic number theory
• The Magma algebra system. I: The user language
• Hermite Normal Form Computation Using Modulo Determinant Arithmetic
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
• Spans in the module (Z_m)^s
• Asymptotically Fast Triangularization of Matrices over Rings
• Hermite and Smith normal form algorithms over Dedekind domains
• Advanced Topics in Computional Number Theory
• A polynomial time algorithm for computing the HNF of a module over the integers of a number field
• Euclidean Rings

This page was built for publication: Computing in quotients of rings of integers