The worst-case running time of the random simplex algorithm is exponential in the height
- 作者Andrei Z. Broder; Martin E. Dyer; Alan M. Frieze; Prabhakar Raghavan; Eli Upfal
- 卷第56卷
- 期第2期
- 印刷ISSN0020-0190
- 文件大小250.13KB
- 发表时间1995
- DOI10.1016/0020-0190(95)00101-h
- 页码79-81
同作者推荐
Fault-containing self-stabilizing distributed protocolsSukumar Ghosh; Arobinda Gupta; Ted Herman; Sriram V. Pemmaraju · 2007
[ACM Press the fifteenth annual ACM symposium - Philadelphia, Pennsylvania, United States (1996.05.23-1996.05.26)] Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 - Fault-containing self-stabilizing algorithmsGhosh, Sukumar; Gupta, Arobinda; Herman, Ted; Pemmaraju, Sriram V. · 1996