Q2913823 (Q2913823): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (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.4086/toc.2012.v008a022 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2293438091 / rank | |||
Normal rank | |||
| 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 | |||
| links / mardi / name | links / mardi / name | ||
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
