The worst-case running time of the random simplex algorithm is exponential in the heightAndrei Z. BroderMartin E. Dyeret al.1995Information Processing Letters