Note on shortest and nearest lattice vectors

Information Processing Letters

Volumn 61, Issue 4, 1997, Pages 183-188

  Henk, Martin ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Computational geometry; Nearest lattice vector; Polar lattice; Shortest lattice vector

Indexed keywords

EID: 0005382386     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00019-7     Document Type: Article

References (10)

1. W. Banaszczyk, New bounds in some transference theorems in the geometry of numbers, Math. Ann. 296 (4) (1993) 625-635.
2. n, C.R. Acad. Sci. Paris Sér. I Math. 300 (1985) 435-438.
3. P. van Emde Boas, Another NP-complete partition problem and the complexity of computing short vectors in a lattice, Rept. 81-04, Mathematical Institute, University of Amsterdam, 1981.
4. M.A. Frumkin, An algorithm for the reduction of a matrix of integers to triangular form with power complexity of the computations, Èkonomika i Matematicheskie Metody 2 (1976) 173-178 (in Russian).
5. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
6. P.M. Gruber and C.G. Lekkerkerker, Geometry of Numbers (North-Holland, Amsterdam, 2nd ed., 1987).
7. R. Kannan, Minkowski's convex body theorem ad integer programming, Math. Oper. Res. 12 (3) (1987) 415-440.
8. R. Kannan and A. Bachem, Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix, SIAM J. Comput. 8 (1979) 499-507.
9. Lovász, An Algorithmic Theory of Numbers, Graphs and Convexity, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 50 (SIAM, Philadelphia, PA, 1986).
10. M. Pohst and H. Zassenhaus, Algorithmic Algebraic Number Theory (Cambridge University Press, Cambridge, MA, 1989).