BibTeX
CSL-JSON
MLA
Harvard
Smoothed analysis of algorithms
release_eqfdmfz2yzhi5pwaz7mgz3h5ze
by
Daniel A. Spielman, Shang-Hua Teng
Released
as a report
.
2002
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.
In text/plain
format
Archived Files and Locations
application/pdf 158.2 kB
file_aox5evmuavcmzhkzg4javxcshy
|
archive.org (archive) |
Read Archived PDF
Preserved and Accessible
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links