2 <sup> log1-ε <i>n</i> </sup> hardness for the closest vector problem with preprocessing (Q5415481)
From MaRDI portal
scientific article; zbMATH DE number 6294575
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2 <sup> log1-ε <i>n</i> </sup> hardness for the closest vector problem with preprocessing |
scientific article; zbMATH DE number 6294575 |
Statements
2 <sup> log1-ε <i>n</i> </sup> hardness for the closest vector problem with preprocessing (English)
0 references
13 May 2014
0 references
PCP
0 references
closest vector problem
0 references
hardness of approximation
0 references
lattices
0 references
nearest codeword problem
0 references
