Smoothed Analysis of Algorithms. Spielman, D. A & Teng, S. ICM, 2002. abstract bibtex Spielman and Teng [STOC '01] introduced the smoothed analysis of al-gorithms 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.
@article{Spielman2002,
abstract = {Spielman and Teng [STOC '01] introduced the smoothed analysis of al-gorithms 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.},
archivePrefix = {arXiv},
arxivId = {arXiv:math/0212413v1},
author = {Spielman, Daniel A and Teng, Shang-Hua},
eprint = {0212413v1},
file = {:home/jax/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Spielman, Teng - 2002 - Smoothed Analysis of Algorithms.pdf:pdf},
journal = {ICM},
keywords = {2000 Mathematics Subject Classification,65Y20,68Q17,68Q25,90C05 Keywords and Phrases,Condition number,Interior point method,Perceptron algorithm,Simplex method,Smoothed analysis},
pages = {597--606},
primaryClass = {arXiv:math},
title = {{Smoothed Analysis of Algorithms}},
year = {2002}
}
Downloads: 0
{"_id":"44HqhiwrurBasD8QW","bibbaseid":"spielman-teng-smoothedanalysisofalgorithms-2002","downloads":0,"creationDate":"2018-01-23T16:20:00.829Z","title":"Smoothed Analysis of Algorithms","author_short":["Spielman, D. A","Teng, S."],"year":2002,"bibtype":"article","biburl":"http://www.jackieflash.com/presentation/example.bib","bibdata":{"bibtype":"article","type":"article","abstract":"Spielman and Teng [STOC '01] introduced the smoothed analysis of al-gorithms 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.","archiveprefix":"arXiv","arxivid":"arXiv:math/0212413v1","author":[{"propositions":[],"lastnames":["Spielman"],"firstnames":["Daniel","A"],"suffixes":[]},{"propositions":[],"lastnames":["Teng"],"firstnames":["Shang-Hua"],"suffixes":[]}],"eprint":"0212413v1","file":":home/jax/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Spielman, Teng - 2002 - Smoothed Analysis of Algorithms.pdf:pdf","journal":"ICM","keywords":"2000 Mathematics Subject Classification,65Y20,68Q17,68Q25,90C05 Keywords and Phrases,Condition number,Interior point method,Perceptron algorithm,Simplex method,Smoothed analysis","pages":"597--606","primaryclass":"arXiv:math","title":"Smoothed Analysis of Algorithms","year":"2002","bibtex":"@article{Spielman2002,\nabstract = {Spielman and Teng [STOC '01] introduced the smoothed analysis of al-gorithms 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.},\narchivePrefix = {arXiv},\narxivId = {arXiv:math/0212413v1},\nauthor = {Spielman, Daniel A and Teng, Shang-Hua},\neprint = {0212413v1},\nfile = {:home/jax/.local/share/data/Mendeley Ltd./Mendeley Desktop/Downloaded/Spielman, Teng - 2002 - Smoothed Analysis of Algorithms.pdf:pdf},\njournal = {ICM},\nkeywords = {2000 Mathematics Subject Classification,65Y20,68Q17,68Q25,90C05 Keywords and Phrases,Condition number,Interior point method,Perceptron algorithm,Simplex method,Smoothed analysis},\npages = {597--606},\nprimaryClass = {arXiv:math},\ntitle = {{Smoothed Analysis of Algorithms}},\nyear = {2002}\n}\n","author_short":["Spielman, D. A","Teng, S."],"key":"Spielman2002","id":"Spielman2002","bibbaseid":"spielman-teng-smoothedanalysisofalgorithms-2002","role":"author","urls":{},"keyword":["2000 Mathematics Subject Classification","65Y20","68Q17","68Q25","90C05 Keywords and Phrases","Condition number","Interior point method","Perceptron algorithm","Simplex method","Smoothed analysis"],"downloads":0,"html":""},"search_terms":["smoothed","analysis","algorithms","spielman","teng"],"keywords":["2000 mathematics subject classification","65y20","68q17","68q25","90c05 keywords and phrases","condition number","interior point method","perceptron algorithm","simplex method","smoothed analysis"],"authorIDs":[],"dataSources":["Nu72uKXnJes3h9u5s"]}