The complexity of the covering radius problem (Q814418)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5003853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the covering radius problem |
scientific article; zbMATH DE number 5003853 |
Statements
The complexity of the covering radius problem (English)
0 references
7 February 2006
0 references
lattices
0 references
linear codes
0 references
covering radius
0 references
approximation algorithms
0 references
hardness of approximation
0 references
complexity classes
0 references
polynomial time hierarchy
0 references
interactive proofs
0 references
0.9329446
0 references
0.91999334
0 references
0 references
0 references
0 references
0 references
0.9018721
0 references
0 references
