Hardness of approximating the shortest vector problem in lattices (Q3546301)
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 5426550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of approximating the shortest vector problem in lattices |
scientific article; zbMATH DE number 5426550 |
Statements
Hardness of approximating the shortest vector problem in lattices (English)
0 references
21 December 2008
0 references
approximation algorithms
0 references
cryptography
0 references
hardness of approximation
0 references
lattices
0 references
shortest vector problem
0 references
0.9146188497543336
0 references
0.9095442295074464
0 references
0.8997579216957092
0 references
0.8858051300048828
0 references
