Computer Science 277

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

Note: This class is no longer being taught.

Title	Concrete Complexity
Units	2
Description	The study of inherent complexity of specific computational problems. Circuit complexity, branching programs, decision tree models, sorting and selection, evasive graph properties, algebraic complexity, communication complexity, VLSI complexity, time/space trade-offs.

Sections Instructor Teaching Effectiveness How worthwhile was this course?

Fall 1996 Zwick 5.6 / 7 ± 0.6
4.9 / 7 ± 0.9

Fall 1992 Karp 6.6 / 7 ± 0.2
6.0 / 7 ± 0.4

Overall Rating Teaching Effectiveness How worthwhile was this course?

Computer Science 277 6.0 / 7 ± 0.2
5.3 / 7 ± 0.3

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