Basic Course Information

EECS 395/495-0-21: Computational Complexity

Fall 2010


Lecturer:
Lance Fortnow

Lectures: MWF 1:00-1:50 in Tech M177

Description:

This course will give an overview of advanced topics in computational
complexity including the P versus NP problem, the structure of NP, the
polynomial-time hierarchy, circuit complexity, randomness, counting,
interactive and probabilistically checkable prooofs.

This course is designed for graduate students or advanced
undergraduates.

Prerequisite: CS 335 (Introduction to Theory of Computing)

Textbook There is no textbook for the course.