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 the normal view instead:
scientific article; zbMATH DE number 6087414
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8997579216957092
0 references
0.8922528028488159
0 references
0.8898002505302429
0 references
