Hardness of the (approximate) shortest vector problem: a simple proof via Reed-Solomon codes (Q6663052)
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 7966946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness of the (approximate) shortest vector problem: a simple proof via Reed-Solomon codes |
scientific article; zbMATH DE number 7966946 |
Statements
Hardness of the (approximate) shortest vector problem: a simple proof via Reed-Solomon codes (English)
0 references
14 January 2025
0 references
lattices
0 references
shortest vector problem
0 references
Reed-Solomon codes
0 references
NP-hardness
0 references
derandomization
0 references
