Smoothed analysis of algorithms

Preprint

1 December 2002

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.math/0212413

Abstract

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.

Keywords

ANALYSIS OF ALGORITHMS
ALGORITHMS SPIELMAN
SMOOTHED ANALYSIS
HEURISTICS
PERFORMED
SURVEY
TENG

All Related Versions

Version 1, 2002-12-01, ArXiv

This publication has 0 references indexed in Scilit: