Technical Report 430-1995

Title

Note on Shortest and Nearest Lattice Vectors

Author

Martin Henk

Source

Download as [ps.gz]

Classification

not available

Keywords

not available

Abstract

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.