What Tropical Geometry Tells Us about the Complexity of Linear Programming (Q5150211)
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: What Tropical Geometry Tells Us about the Complexity of Linear Programming |
scientific article; zbMATH DE number 7308560
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | What Tropical Geometry Tells Us about the Complexity of Linear Programming |
scientific article; zbMATH DE number 7308560 |
Statements
What Tropical Geometry Tells Us about the Complexity of Linear Programming (English)
0 references
10 February 2021
0 references
linear programming
0 references
central path
0 references
strongly polynomial complexity
0 references
continuous analogue of the Hirsch conjecture
0 references
tropical geometry
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9086841
0 references
0.8979605
0 references
0 references
0.8923429
0 references
0 references
0 references
0.88394254
0 references
0.88177586
0 references
0 references
