The nearest-colattice algorithm: time-approximation tradeoff for approx-CVP (Q5853801)
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 nearest-colattice algorithm: time-approximation tradeoff for approx-CVP |
scientific article; zbMATH DE number 7319971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The nearest-colattice algorithm: time-approximation tradeoff for approx-CVP |
scientific article; zbMATH DE number 7319971 |
Statements
The nearest-colattice algorithm: Time-approximation tradeoff for approx-CVP (English)
0 references
11 March 2021
0 references
lattice
0 references
closest vector problem
0 references
0.8320469260215759
0 references
0.8141831755638123
0 references
0.810946524143219
0 references
0.802778422832489
0 references
