## Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (2003)

by
Daniel A. Spielman
,
Shang-hua Teng

Citations: | 145 - 13 self |

### BibTeX

@MISC{Spielman03smoothedanalysis,

author = {Daniel A. Spielman and Shang-hua Teng},

title = {Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time},

year = {2003}

}

### Years of Citing Articles

### OpenURL

### Abstract

We introduce the smoothed analysis of algorithms, which continuously interpolates between the worst-case and average-case analyses 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 smoothed complexity polynomial in the input size and the standard deviation of