Hardness of approximating the shortest vector problem in lattices (Q3546301): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q57567974, #quickstatements; #temporary_batch_1712272666262 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| 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 | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02: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
