Hardness of approximating the shortest vector problem in lattices (Q3546301): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1089023.1089027 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056492141 / rank | |||
Normal rank | |||
Revision as of 22:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness of approximating the shortest vector problem in lattices |
scientific article |
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
