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
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.