Spring 2012
This course will cover a variety of topics in computational complexity including pseudorandomness, counting complexity, quantum computing and the structure of complete sets.
Prerequisite: EECS 335 or equivalent
There will be no textbook for the course. This blog will link to papers and scribe notes.
There will be no textbook for the course. This blog will link to papers and scribe notes.
Grading will be based on scribe notes and a presentation of a recent paper in computational complexity.
No comments:
Post a Comment