Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (Q2490259)
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 5021331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms |
scientific article; zbMATH DE number 5021331 |
Statements
Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms (English)
0 references
28 April 2006
0 references
Computational complexity
0 references
Lattices
0 references
Shortest vector problem
0 references
Approximation algorithms
0 references
Hardness of approximation
0 references
0 references
0 references
0.9095442295074464
0 references
0.8604736924171448
0 references
0.8589557409286499
0 references
0.8459855318069458
0 references
