Improved Inapproximability of Lattice and Coding Problems With Preprocessing (Q3547549): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q375694 |
Changed an Item |
||
| Property / author | |||
| Property / author: Oded Regev / rank | |||
Normal rank | |||
Revision as of 22:39, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved Inapproximability of Lattice and Coding Problems With Preprocessing |
scientific article |
Statements
Improved Inapproximability of Lattice and Coding Problems With Preprocessing (English)
0 references
21 December 2008
0 references
CVP
0 references
Closest vector problem
0 references
NCP
0 references
NP-hardness
0 references
RNCP
0 references
computational complexity
0 references
linear codes
0 references
nearest codeword problem
0 references
relatively nearest codeword problem
0 references
