CATALOG DESCRIPTION: This course will cover a variety of topics in computational complexity including pseudorandomness, counting complexity, quantum computing and the structure of complete sets.
INSTRUCTOR:   

PREREQUISITE: EECS 335 or equivalent
TEXTBOOK: There will be no textbook for the course. This blog will link to papers and scribe notes.
GRADES: Grading will be based on scribe notes and a presentation of a recent paper in computational complexity.