About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
CCC 1999
Conference paper
Note on the shortest lattice vector problem
Abstract
The problem of deciding whether a given rational lattice L has a vector of length less than some given value r is addressed. It is demonstrated that this problem is NP-hard under randomized reductions, even under the promise that L has exactly zero or one vector of length less than r.