A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming (Q2894466): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:33, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming |
scientific article |
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
