Q2913823 (Q2913823): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Hardness of approximating the shortest vector problem in lattices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The hardness of the closest vector problem with preprocessing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sieve algorithms for the shortest vector problem are practical / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The intractability of computing the minimum distance of a code / rank | |||
Normal rank | |||
Latest revision as of 18:07, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | No label defined |
scientific article |
Statements
27 September 2012
0 references
lattices
0 references
shortest vector problem
0 references
NP-hardness
0 references
hardness of approximation
0 references
randomized reductions
0 references
