Hardness of approximating the shortest vector problem in lattices (Q3546301): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q57567974, #quickstatements; #temporary_batch_1712272666262 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57567974 / rank | |||
Normal rank | |||
Revision as of 01:47, 5 April 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
