The worst-case running time of the random simplex algorithm is exponential in the height (Q671935): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q583109 |
Created claim: Wikidata QID (P12): Q56324060, #quickstatements; #temporary_batch_1714633800427 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Alan M. Frieze / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56324060 / rank | |||
Normal rank | |||
Revision as of 09:13, 2 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The worst-case running time of the random simplex algorithm is exponential in the height |
scientific article |
Statements
The worst-case running time of the random simplex algorithm is exponential in the height (English)
0 references
27 February 1997
0 references
Linear programming
0 references
Algorithms
0 references
Simplex algorithm
0 references
Randomized algorithm
0 references
