Inapproximability of the shortest vector problem: toward a deterministic reduction (Q2913823)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Inapproximability of the shortest vector problem: toward a deterministic reduction |
scientific article; zbMATH DE number 6087414
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inapproximability of the shortest vector problem: toward a deterministic reduction |
scientific article; zbMATH DE number 6087414 |
Statements
27 September 2012
0 references
lattices
0 references
shortest vector problem
0 references
NP-hardness
0 references
hardness of approximation
0 references
randomized reductions
0 references
Inapproximability of the shortest vector problem: toward a deterministic reduction (English)
0 references
