Searching for "The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract)." – sorted by Relevance.
-
complex variable, International Series in Pure and Applied Mathematics.
- and Applied Mathematics. [3] M. Ajtai. The shortest vector problem in L2 is NP-hard for randomized reductions
- Add To MetaCart

