A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming (Q2894466): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1109.2477 / rank | |||
Normal rank | |||
Latest revision as of 09:41, 19 April 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
