A polynomial time algorithm for GapCVPP in \(l_1\) norm (Q893692)
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: A polynomial time algorithm for GapCVPP in l₁ norm |
scientific article; zbMATH DE number 6512333
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for GapCVPP in \(l_1\) norm |
scientific article; zbMATH DE number 6512333 |
Statements
A polynomial time algorithm for GapCVPP in \(l_1\) norm (English)
0 references
20 November 2015
0 references
lattices
0 references
algorithm
0 references
Laplace measures
0 references
closest vector problem with preprocessing
0 references
computational complexity
0 references
0.8188725709915161
0 references
0.8166022896766663
0 references
0.806999921798706
0 references
0.806763231754303
0 references
0.8035798668861389
0 references
