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
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Sonia Cafieri, Jon Lee, et al.
Journal of Global Optimization
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking