The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions.

Electronic colloquium on computational complexity · 1997 · 248 citations · 0 references