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.
Home 
Course Descriptions: EECS 395/495 (Topics in) Computational Complexity
Course Descriptions: EECS 395/495 (Topics in) Computational Complexity
EECS 395/495 - (Special Topics) Computational Complexity
Course schedules & descriptions
Search Courses by Instructor
Computer Science course tags
Robert R. McCormick School of Engineering and Applied Science
Electrical Engineering & Computer Science Home | McCormick Home | Northwestern Home
© 2013 Robert R. McCormick School of Engineering and Applied Science, Northwestern University
Maps | Contact Us | Calendar
TECH: 2145 Sheridan Rd, Tech L359, Evanston IL 60208-3118 USA | Phone: (847) 491-5410 | Fax: (847) 491-4455
FORD: 2133 Sheridan Rd, Ford Building, Rm 3.320, Evanston IL 60201 USA | Phone: (847) 491-5410 | Fax: (847) 491-5258
Questions about this site? Please email the webmaster | Legal and Policy Statements