The worst-case running time of the random simplex algorithm is exponential in the height
| Image |  |
|---|---|
| Description | article by Andrei Z. Broder et al published October 1995 in Information Processing Letters |
| Author/s |
author: Alan M. Frieze Andrei Broder Eli Upfal Prabhakar Raghavan |
| Publication date | October 1995 |
| Language | |
| Country of origin | |
| Wikipedia link | |
| Copyright status | |
| Missing/wrong data? | Edit Wikidata item |