Computer Science 278

[Email HKN about this data] [Info about this page]

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?

Fall 2004 Trevisan 5.7 / 7 ± 0.7
6.2 / 7 ± 0.5

Fall 2002 Trevisan 4.2 / 7 ± 0.8
4.9 / 7 ± 0.8

Spring 2001 Trevisan 5.8 / 7 ± 0.8
6.0 / 7 ± 0.4

Fall 1997 Rudich 6.4 / 7 ± 0.4
6.5 / 7 ± 0.4

Spring 1995 Vazirani 6.5 / 7 ± 0.5
6.7 / 7 ± 0.3

Fall 1993 Vazirani 5.5 / 7 ± 0.8
5.6 / 7 ± 0.6

Spring 1990 Vazirani 5.2 / 7 ± 0.8
4.9 / 7 ± 1.0

Overall Rating Teaching Effectiveness How worthwhile was this course?

Computer Science 278 5.5 / 7 ± 0.1
5.9 / 7 ± 0.1

Hint: You can click on the colored rating bars to see detailed statistics on a particular rating.