Princeton University
Computer Science Dept.

Computer Science 522
Advanced Complexity Theory

Sanjeev Arora

Fall 2011




Directory
General Information | Assignments | Handouts | Interesting Links|



Homework 1 (due Sept 29 in class): Do the following questions from text: 2.9, 2.19, 2.29, 2.30, 3.2, 3.3, 3.4, 4.5, 4.7, 4.9
Homework 2( due Oct 13 in class):
Questions 5.1; 5.6, 5.10; 6.3, 6.5; 6.18; 7.3; 7.7;7.8. 
Homework 3(due Nov 7 in class): Questions 8.5,8.8,9.6,9.10,9.12,9.16,17.5.  (Based upon Chapters 8, 9, 17. But Sections 17.3, 9.4 are optional reading.)
Homework 4( due Dec 2): Questions 19.7, 19.8, 19.15, 20.4, 20.6, 20.10,  21.17,   21.20, 11.8, 11.9. (Based upon chapters 19.1--19.4, 20.1,20.2, Chapter 21-1-21.5, Chapter 11.)
Homework 5 (due Jan 6): Exercises 2 and 6 from Avi's Notes, Qs 22.2, 23.4 from the book, and B.1 from the web chapter on Williams's proof.  (Reading: Avi's notes, Chapter 14, Chapter 23, Web Chapter B)

 


Honor Code for this class

Collaborating with your classmates on assignments is encouraged (and may be essential to get the most out of the course). You must, however, list your collaborators for each problem. The assignment questions have been carefully selected for their pedagogical value and may be similar to questions on problem sets from past offerings of this course or courses at other universities. Using any preexisting solutions from these or any other sources is strictly prohibited.