A \(O(1/\epsilon ^{2})^{n }\)-time sieving algorithm for approximate integer programming (Q2894466)
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 6051298
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A \(O(1/\epsilon ^{2})^{n }\)-time sieving algorithm for approximate integer programming |
scientific article; zbMATH DE number 6051298 |
Statements
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming (English)
0 references
29 June 2012
0 references
integer programming
0 references
shortest vector problem
0 references
closest vector problem
0 references
0.9648306369781494
0 references
0.7670009136199951
0 references
0.7652683854103088
0 references
0.7637625932693481
0 references
