Smoothed analysis of algorithms
| dc.creator | Spielman, Daniel A. | |
| dc.creator | Teng, Shang-Hua | |
| dc.date | 2002-12-01 | |
| dc.date.accessioned | 2026-07-07T04:54:11Z | |
| dc.date.available | 2026-07-07T04:54:11Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/0212413 | |
| dc.identifier | http://arxiv.org/abs/math/0212413 | |
| dc.identifier | Proceedings of the ICM, Beijing 2002, vol. 1, 597--606 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/66150 | |
| dc.subject | Optimization and Control | |
| dc.subject | 65Y20, 68Q17, 68Q25, 90C05 | |
| dc.title | Smoothed analysis of algorithms | |
| dc.type | text |