Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
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
Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
Conference paper
True 3-D displays for avionics and mission crewstations
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Gal Badishi, Idit Keidar, et al.
IEEE TDSC