## Daniel A. Spielman, Shang-Hua Teng

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

STOC, 2001.

@inproceedings{STOC-2001-SpielmanT, author = "Daniel A. Spielman and Shang-Hua Teng", booktitle = "{Proceedings of the 33rd Annual ACM Symposium on Theory of Computing}", doi = "10.1145/380752.380813", isbn = "1-58113-349-9", pages = "296--305", publisher = "{ACM}", title = "{Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time}", year = 2001, }