-
-
Courses
Find courses by:
Collections
Cross-Disciplinary Topic Lists
Translated Courses
-
About
-
Donate
-
Featured Sites
A smoothed complexity landscape. (Image courtesy of Prof. Daniel Spielman.)
Prof. Daniel Spielman
18.409
Spring 2002
Graduate
This course is a study of Behavior of Algorithms and covers an area of current interest in theoretical computer science. The topics vary from term to term. During this term, we discuss rigorous approaches to explaining the typical performance of algorithms with a focus on the following approaches: smoothed analysis, condition numbers/parametric analysis, and subclassing inputs.
MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,000 courses available, OCW is delivering on the promise of open sharing of knowledge.
© 2001–2012
Massachusetts Institute of Technology
Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.
