Computing a lattice basis revisited
From MaRDI portal
Recommendations
Cited in
(14)- Well-behaved basis and LR arrays
- Satins, lattices, and extended Euclid's algorithm
- Slide reduction, revisited -- filling the gaps in SVP approximation
- LCM Lattices and Stanley Depth: A First Computational Approach
- scientific article; zbMATH DE number 5149740 (Why is no real title available?)
- Computation of lattice isomorphisms and the integral matrix similarity problem
- An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
- Computing a lattice basis from a system of generating vectors
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
- Lattice-based inner product argument
- Computing efficiently the lattice width in any dimension
- A complete analysis of the BKZ lattice reduction algorithm
- On the smallest ratio problem of lattice bases
- Calculation of Minkowski-reduced lattice bases
This page was built for publication: Computing a lattice basis revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5121117)