The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Smoothed analysis of algorithms
[article]
2002
arXiv
pre-print
Spielman and Teng introduced the smoothed analysis of algorithms to provide a framework in which one could explain the success in practice of algorithms and heuristics that could not be understood through the traditional worst-case and average-case analyses. In this talk, we survey some of the smoothed analyses that have been performed.
arXiv:math/0212413v1
fatcat:eqfdmfz2yzhi5pwaz7mgz3h5ze