The Shortest Vector Problem in ::::L::2:::::: is ::::NP::::-hard for Randomized Reductions (Extended Abstract)

Miklós Ajtai. The Shortest Vector Problem in ::::L::2:::::: is ::::NP::::-hard for Randomized Reductions (Extended Abstract). In STOC. pages 10-19, 1998. [doi]

Abstract

Abstract is missing.