Title :
A note on the shortest lattice vector problem
Author :
Kumar, Ravi ; Sivakumar, D.
Author_Institution :
IBM Almaden Res. Center, San Jose, CA, USA
Abstract :
We show that the problem of deciding whether a given rational lattice L has a vector of length less than some given value r is NP-hard under randomized reductions, even under the promise that L has exactly zero or one vector of length less than r
Keywords :
computational complexity; randomised algorithms; NP-hard; randomized reductions; rational lattice; shortest lattice vector problem; Computer science; Electronic switching systems; Engineering profession; Lattices; Polynomials; Search problems; Vectors;
Conference_Titel :
Computational Complexity, 1999. Proceedings. Fourteenth Annual IEEE Conference on
Conference_Location :
Atlanta, GA
Print_ISBN :
0-7695-0075-7
DOI :
10.1109/CCC.1999.766277
