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. In STOC. pages 296-305, 2001. [doi]

Abstract

Abstract is missing.