%0 Journal Article %1 spielman04 %A Spielman, Daniel A. %A Teng, Shang-Hua %C New York, NY, USA %D 2004 %I ACM %J J. ACM %K algorithm simplex smoothed-analysis %N 3 %P 385--463 %R 10.1145/990308.990310 %T Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time %V 51 %X 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 Gaussian perturbations.

@article{spielman04, 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 Gaussian perturbations.}, acmid = {990310}, added-at = {2016-10-27T07:51:03.000+0200}, address = {New York, NY, USA}, author = {Spielman, Daniel A. and Teng, Shang-Hua}, biburl = {https://www.bibsonomy.org/bibtex/2cdf92e43479f032c612f24e3dc1fa294/ytyoun}, doi = {10.1145/990308.990310}, interhash = {36b84bfc8a59f2cdd507e62d947ca6e4}, intrahash = {cdf92e43479f032c612f24e3dc1fa294}, issn = {0004-5411}, issue_date = {May 2004}, journal = {J. ACM}, keywords = {algorithm simplex smoothed-analysis}, month = may, number = 3, numpages = {79}, pages = {385--463}, publisher = {ACM}, timestamp = {2016-10-29T12:31:03.000+0200}, title = {Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time}, volume = 51, year = 2004 }