\(2^{\log^{1-\varepsilon} n}\) hardness for the closest vector problem with preprocessing (Q5415481)
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 6294575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(2^{\log^{1-\varepsilon} n}\) 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
0.9609644412994384
0 references
0.915122091770172
0 references
0.8957778215408325
0 references
0.8876804709434509
0 references
0.8790670037269592
0 references
