Spielman, Daniel A. and Shang-Hua Teng, Analysis: Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time, 2003, arXiv: cs/0111050, pre-published.
web page · https://doi.org/10.48550/arXiv.cs/0111050
Spielman, Daniel A. and Shang-Hua Teng, Analysis: Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time, 2003, arXiv: cs/0111050, pre-published.
web page · https://doi.org/10.48550/arXiv.cs/0111050