Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice (Q757465): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Jeffrey C. Lagarias / rank | |||
Property / author | |||
Property / author: Hendrik W. jun. Lenstra / rank | |||
Property / author | |||
Property / author: Claus Peter Schnorr / rank | |||
Property / reviewed by | |||
Property / reviewed by: Michael E. Pohst / rank | |||
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 | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Lovász' lattice reduction and the nearest lattice point problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factoring polynomials with rational coefficients / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integer Programming with a Fixed Number of Variables / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3745276 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5770049 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5800844 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3318849 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5568974 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A hierarchy of polynomial time lattice basis reduction algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Die Reduktionstheorie der positiven quadratischen Formen / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5577272 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02128669 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1973270757 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:39, 30 July 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