Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing (Q3190696): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 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.1137/130919623 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048695439 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:40, 19 March 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
