Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

Daniel A. Spielman, Shang-Hua Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM, 51(3):385-463, 2004. [doi]

Abstract

Abstract is missing.