2002/12/01 by Daniel A. Spielman, Shang-Hua Teng · 2 citations
Mathematics · #math.OC #msc:65Y20 #msc:68Q17 #msc:68Q25 #msc:90C05
published as Proceedings of the ICM, Beijing 2002, vol. 1, 597--606
arxiv created 2002/12/01 · arxiv updated 2009/12/01
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.