Pages that link to "Item:Q5121117"
From MaRDI portal
The following pages link to Computing a Lattice Basis Revisited (Q5121117):
Displaying 14 items.
- Computing efficiently the lattice width in any dimension (Q638564) (← links)
- Calculation of Minkowski-reduced lattice bases (Q762199) (← links)
- Well-behaved basis and LR arrays (Q1916504) (← links)
- Satins, lattices, and extended Euclid's algorithm (Q2070141) (← links)
- Slide reduction, revisited -- filling the gaps in SVP approximation (Q2096526) (← links)
- LCM Lattices and Stanley Depth: A First Computational Approach (Q2801068) (← links)
- (Q3435607) (← links)
- Computation of lattice isomorphisms and the integral matrix similarity problem (Q5041469) (← links)
- An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers (Q5121132) (← links)
- Computing a lattice basis from a system of generating vectors (Q5393303) (← links)
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
- Lattice-based inner product argument (Q6160829) (← links)
- A complete analysis of the BKZ lattice reduction algorithm (Q6665548) (← links)
- On the smallest ratio problem of lattice bases (Q6666549) (← links)
