A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\) (Q1941539): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401498911 |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1555903671 / rank | |||
Normal rank |
Revision as of 00:51, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\) |
scientific article |
Statements
A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\) (English)
0 references
13 March 2013
0 references
quasiconvex integer optimization
0 references
Lenstra's algorithm
0 references
SVP
0 references
ellipsoid rounding
0 references