On the computation of the HNF of a module over the ring of integers of a number field
From MaRDI portal
Publication:1711990
DOI10.1016/j.jsc.2016.07.027zbMath1403.11084arXiv1612.09428OpenAlexW2491310312WikidataQ110883424 ScholiaQ110883424MaRDI QIDQ1711990
Tommy Hofmann, Claus Fieker, Jean-François Biasse
Publication date: 21 January 2019
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.09428
Related Items (6)
Computation of lattice isomorphisms and the integral matrix similarity problem ⋮ Constructing totally p-adic numbers of small height ⋮ Algebraic number fields and the LLL algorithm ⋮ On module unique-SVP and NTRU ⋮ On the construction of class fields ⋮ Computing isomorphisms between lattices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topics in computational algebraic number theory
- On the deterministic complexity of factoring polynomials over finite fields
- Exact solution of linear equations using p-adic expansions
- On the Galois cohomology of Dedekind rings
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- Fast multiplication of large numbers
- Approximate formulas for some functions of prime numbers
- Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction
- An LLL Algorithm with Quadratic Complexity
- Spans in the module (Zm)s
- Asymptotically Fast Triangularization of Matrices over Rings
- Hermite and Smith normal form algorithms over Dedekind domains
- Short Bases of Lattices over Number Fields
- Advanced Topics in Computional Number Theory
- A polynomial time algorithm for computing the HNF of a module over the integers of a number field
- An LLL-reduction algorithm with quasi-linear time complexity
- On the Theorem on the Primitive Element
This page was built for publication: On the computation of the HNF of a module over the ring of integers of a number field
