Skip to main content
Conference Proceedings

The smoothed analysis of algorithms

Lecture Notes in Computer Science (2005) 3623 17-18
DOI: 10.1007/11537311_2
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We survey the progress that has been made in the smoothed analysis of algorithms. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Spielman, D. A. (2005). The smoothed analysis of algorithms. In Lecture Notes in Computer Science (Vol. 3623, pp. 17–18). Springer Verlag. https://doi.org/10.1007/11537311_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free