Behavior of Algorithms
As taught in: Spring 2002
A smoothed complexity landscape. (Image courtesy of Prof. Daniel Spielman.)
Instructors:
Prof. Daniel Spielman
MIT Course Number:
18.409
Level:
Graduate
Course Features
Course Description
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.
