J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Paper
On the unique shortest lattice vector problem
Abstract
The problem of deciding whether a given rotational lattice L has a vector of length less than some given value r is shown to be NP-hard. This problem is even under the premise that L has exactly zero or one vector of length less than r. The premise is also under randomized conditions.
Related
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Robert G. Farrell, Catalina M. Danis, et al.
RecSys 2012
Conference paper
Performance measurement and data base design
Alfonso P. Cardenas, Larry F. Bowman, et al.
ACM Annual Conference 1975