Note on Shortest and Nearest Lattice Vectors

We show that with respect to a certain class of norms the so-called shortest lattice vector problem is polynomial-time Turing (Cook) reducible to the nearest lattice vector problem. This gives a little more insight in the relationship of these two fundamental problems in the computational geometry of numbers.

[1]  F. Thorne,et al.  Geometry of Numbers , 2017, Algebraic Number Theory.

[2]  Ravi Kannan,et al.  Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

[3]  Michael Pohst,et al.  Algorithmic algebraic number theory , 1989, Encyclopedia of mathematics and its applications.

[4]  Ravi Kannan,et al.  Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[5]  László Lovász,et al.  Algorithmic theory of numbers, graphs and convexity , 1986, CBMS-NSF regional conference series in applied mathematics.

[6]  W. Banaszczyk.  New bounds in some transference theorems in the geometry of numbers , 1993 .

[7]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .