18.409 Behavior of Algorithms

As taught in: Spring 2002

A colored landscape chart.

A smoothed complexity landscape. (Image courtesy of Prof. Daniel Spielman.)

Level:

Graduate

Instructors:

Prof. Daniel Spielman

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.

Technical Requirements

Special software is required to use some of the files in this course: .m, .mat.