Tensor-based hardness of the shortest vector problem to within almost polynomial factors (Q2913824)
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: Tensor-based hardness of the shortest vector problem to within almost polynomial factors |
scientific article; zbMATH DE number 6087415
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tensor-based hardness of the shortest vector problem to within almost polynomial factors |
scientific article; zbMATH DE number 6087415 |
Statements
27 September 2012
0 references
lattices
0 references
shortest vector problem
0 references
NP-hardness
0 references
hardness of approximation
0 references
Tensor-based hardness of the shortest vector problem to within almost polynomial factors (English)
0 references
