Spielman, Daniel and Shang-Hua Teng, ‘Smoothed analysis of algorithms’: ‘Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time’, Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001, pp 296–305.
conference paper · https://doi.org/10.1145/380752.380813