Skip to main content
Conference Proceedings

Smoothed analysis of algorithms and heuristics

Lecture Notes in Computer Science (2005) 3595 10-11
DOI: 10.1007/11533719_3
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Teng, S. H. (2005). Smoothed analysis of algorithms and heuristics. In Lecture Notes in Computer Science (Vol. 3595, pp. 10–11). Springer Verlag. https://doi.org/10.1007/11533719_3

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