Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (Q1608337)
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: Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard |
scientific article; zbMATH DE number 1776347
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard |
scientific article; zbMATH DE number 1776347 |
Statements
Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard (English)
0 references
5 August 2002
0 references
shortest vector
0 references
lattice problems
0 references
hardness of approximation
0 references
