CSE 532
Computational Complexity Ii
Credits
3.0
Lead Instructor
Paul Beame
Textbook
None
Course Description
Advanced computational complexity including several of the following: circuit complexity lower bounds, #p and counting classes, probabilistically-checkable proofs, de-randomization, logical characteristics of complexity, communication complexity, time-space tradeoffs, complexity of data structures.
Prerequisites
CSE majors only; Recommended: CSE 531.
CE Major Status
None
Course Objectives
none
ABET Outcomes
No outcomes registered
Course Topics