Hardness of approximating the shortest vector problem in lattices (Q3546301): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/jacm/Khot05, #quickstatements; #temporary_batch_1731475607626 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| 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 | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57567974 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jacm/Khot05 / rank | |||
Normal rank | |||
Latest revision as of 07:14, 13 November 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
