Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing (Q3190696)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing |
scientific article |
Statements
Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing (English)
0 references
18 September 2014
0 references
hardness of approximation
0 references
closest vector problem
0 references
smooth label cover
0 references
sum check protocol
0 references
