Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time [article]

Daniel A. Spielman, Shang-Hua Teng
2003 arXiv   pre-print
We introduce the smoothed analysis of algorithms, which is a hybrid of the worst-case and average-case analysis of algorithms. In smoothed analysis, we measure the maximum over inputs of the expected performance of an algorithm under small random perturbations of that input. We measure this performance in terms of both the input size and the magnitude of the perturbations. We show that the simplex algorithm has polynomial smoothed complexity.
arXiv:cs/0111050v7 fatcat:egicx77z6fc43mqerxgei3kfdq