Computer Science 278

Title	Machine-Based Complexity Theory
Units	3
Prerequisites	170.
Description	Properties of abstract complexity measures; Determinism vs. nondeterminism; time vs. space; complexity hierarchies; aspects of the P-NP question; relative power of various abstract machines.

Sections	Instructor	Teaching Effectiveness	How worthwhile was this course?
Spring 2021	Avishay Tal	6.8 / 7	6.3 / 7
Fall 2016	Prasad Raghavendra	6.7 / 7	6.7 / 7
Spring 2014	Prasad Raghavendra	5.9 / 7	5.8 / 7
Spring 2008	Luca Trevisan	5.8 / 7	5.9 / 7
Fall 2004	Luca Trevisan	5.7 / 7	6.2 / 7
Fall 2002	Luca Trevisan	4.2 / 7	4.9 / 7
Spring 2001	Luca Trevisan	5.8 / 7	6.0 / 7
Fall 1997	Steven Rudich	6.4 / 7	6.5 / 7
Spring 1995	Umesh Vazirani	6.5 / 7	6.7 / 7
Fall 1993	Umesh Vazirani	5.5 / 7	5.6 / 7
Spring 1990	Umesh Vazirani	5.2 / 7	4.9 / 7
Overall Rating		Teaching Effectiveness	How worthwhile was this course?
		5.9 / 7	6.0 / 7