Approximate CVP\(_p\) in time \(2^{0.802n}\) (Q2051858)
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 7433358
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate CVP\(_p\) in time \(2^{0.802n}\) |
scientific article; zbMATH DE number 7433358 |
Statements
Approximate CVP\(_p\) in time \(2^{0.802n}\) (English)
0 references
25 November 2021
0 references
lattice and integer programming
0 references
algorithmic geometry of numbers
0 references
sieving
0 references
geometric covering
0 references
0 references
0 references
0 references
0 references
0 references
0.923498809337616
0 references
0.8385715484619141
0 references
0.8335111737251282
0 references
0.831539511680603
0 references
