On the complexity of quasiconvex integer minimization problem (Q2423784)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of quasiconvex integer minimization problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of quasiconvex integer minimization problem |
scientific article |
Statements
On the complexity of quasiconvex integer minimization problem (English)
0 references
20 June 2019
0 references
nonlinear integer programming
0 references
conic functions
0 references
quasiconvex functions
0 references
quasiconvex polynomials
0 references
convex functions
0 references
comparison oracle
0 references
oracle model
0 references
complexity
0 references
0 references
0 references
0 references
0 references
0 references
0.8657424449920654
0 references
0.8239463567733765
0 references
0.8153434991836548
0 references
0.812938392162323
0 references
0.7929263114929199
0 references
