Rolf Clauberg
IBM J. Res. Dev
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.
Rolf Clauberg
IBM J. Res. Dev
Limin Hu
IEEE/ACM Transactions on Networking
Minkyong Kim, Zhen Liu, et al.
INFOCOM 2008
György E. Révész
Theoretical Computer Science