Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors (Q2913824)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors |
scientific article |
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
