Work

The shortest vector problem in L 2 is NP -hard for randomized reductions (extended abstract)

Year: 1998
Type: conference-paper
Language: English
Open Access status: closed
OpenAlex ID: W2012589104
FWCI: 6.757
Cites: 17
Cited by: 460
Related to: 10