Computer Science 221: Computational Complexity

Prof. Salil Vadhan

A quantitative theory of the resources needed for computing and the impediments to efficient computation. The models of computation considered include ones that are finite or infinite, deterministic, randomized, quantum or nondeterministic, discrete or algebraic, sequential or parallel.

This course is also often taught by Les Valiant. Below are materials from my offerings of the course.

Spring 2014

Spring 2010

Spring 2006

Fall 2002