Publications

The worst-case running time of the random simplex algorithm is exponential in the height

• • Andrei Z. Broder
  • Martin E. Dyer
  • et al.
• 1995
• Information Processing Letters