The inapproximability of lattice and coding problems with preprocessing (Q1881262)
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: The inapproximability of lattice and coding problems with preprocessing |
scientific article; zbMATH DE number 2106007
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The inapproximability of lattice and coding problems with preprocessing |
scientific article; zbMATH DE number 2106007 |
Statements
The inapproximability of lattice and coding problems with preprocessing (English)
0 references
4 October 2004
0 references
point lattices
0 references
coding theory
0 references
closest vector problem
0 references
nearest codeword problem
0 references
preprocessing computational complexity
0 references
NP-hardness
0 references
approximation problems
0 references
0 references
