Storage efficient algorithm for Hermite normal form using LLL
From MaRDI portal
(Redirected from Publication:2229458)
Recommendations
- A linear space algorithm for computing the hermite normal form
- Computing Hermite Normal Form Faster via Solving System of Linear Equations
- Complexity of the Havas, Majewski, Matthews LLL Hermite normal form algorithm
- scientific article; zbMATH DE number 842016
- scientific article; zbMATH DE number 1254301
Cites work
- scientific article; zbMATH DE number 1852141 (Why is no real title available?)
- A linear space algorithm for computing the hermite normal form
- Algorithmic Number Theory
- An Introduction to Mathematical Cryptography
- An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
- Computing Hermite Normal Form Faster via Solving System of Linear Equations
- Extended GCD and Hermite Normal Form Algorithms via Lattice Basis Reduction
- Factoring polynomials with rational coefficients
- Fast computation of Hermite normal forms of random integer matrices
- Generating shorter bases for hard random lattices
- Hermite Normal Form Computation Using Modulo Determinant Arithmetic
- Lattice basis reduction. An introduction to the LLL algorithm and its applications
- Probabilistic analyses of the plain multiple gcd algorithm
- Short bases of lattices over number fields
- Two fast parallel GCD algorithms of many integers
This page was built for publication: Storage efficient algorithm for Hermite normal form using LLL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229458)