James A. Foster

Home Up Next

CS 496/596: Computational Complexity Theory

Computational complexity theory investigates inherent limitations to computation in a world of limited resources. We develop models of computation with bounded access to resources such as time and space, classify problems according what can be solved with these restrictions, and investigate the implications of this classification.

We will investigate what is known about common complexity classes which capture such ideas as feasibility, randomized algorithms, boolean circuits, parallel computation, and interactive proofs. Along the way, we will learn some of the major recent results in this area.

bullet Course information (objectives, activities, etc.)
bullet Course announcements:
bullet Lecture notes are now available online
bullet New Office Hours: M 1:30-3:30, Thur 1:30-2:30 or by Appointment
bullet How to view postscript files (courtesy of Dr. Jim Alves-Foss), like those on the course ftp site
bullet Course Syllabus
bullet Internet Resources

The instructor for this course is James A. Foster. His office is JEB B24 (in the basement by the elevator), email id is foster@cs.uidaho.edu, phone number 208.885.7062 (though he responds better to email).

Course prerequisites are CS490/Ma485 (Theory of Computation) and CS495/Ma475 (Analysis of Algorithms), or the consent of the instructor.

Here is a picture of (most of) the students in the local section of the class:

Last Updated 01/13/2003 15:56 -0800