✦ LIBER ✦
The worst-case running time of the random simplex algorithm is exponential in the height
✍ Scribed by Andrei Z. Broder; Martin E. Dyer; Alan M. Frieze; Prabhakar Raghavan; Eli Upfal
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 250 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.