Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (Q757465): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Jeffrey C. Lagarias / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Hendrik W. jun. Lenstra / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Claus Peter Schnorr / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Michael E. Pohst / rank | |||
Normal rank |
Revision as of 00:09, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice |
scientific article |
Statements
Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (English)
0 references
1990
0 references
The authors derive estimates relating the following quantities of a lattice L in Euclidean space: (i) the (Euclidean) lengths of the basis vectors of a lattice basis which is reduced in the sense of Korkine- Zolotareff, (ii) the successive minima of L and its dual lattice \(L^*\), (iii) the covering radius \(\mu\) (L) of L, (iv) Hermite's constants. They also develop methods which allow to compute in polynomial time lower bounds for the first successive minimum and the distance of a given vector from the closest lattice point. They give a short account on the computational complexity of finding shortest (closest) vectors in a lattice. Finally, they generalize several of their estimates to arbitrary symmetric convex distance functions.
0 references
Korkin-Zolotareff reduction
0 references
lattice
0 references
lattice basis
0 references
successive minimum
0 references
computational complexity
0 references