Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing (Q3190696): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 22:56, 3 February 2024
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