Towards a Genuinely Polynomial Algorithm for Linear Programming (Q3315270)
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: Towards a Genuinely Polynomial Algorithm for Linear Programming |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Towards a Genuinely Polynomial Algorithm for Linear Programming |
scientific article |
Statements
Towards a Genuinely Polynomial Algorithm for Linear Programming (English)
0 references
1983
0 references
convex minimization
0 references
computational complexity
0 references
genuinely polynomial algorithm
0 references
linear inequalities
0 references
at most two variables per inequality
0 references
binary search
0 references
