Homework Policies: The homework exercised are an essential part of this course because the practice solving problems is important part of understanding the material. You can probably find many of the solutions to the homework exercises on the internet or in the literature but you will not get the benefit of solving the problems on your own. Therefore, the only sources you are allowed to consult in solving these problems are the text and notes from class (your own or those of a classmate).
I encourage you to work in small groups, but you must note your collaborators on the homework you turn in. In addition, you must write up your own solutions without any collaboration.
You are also encouraged to put your solutions into LaTeX. Here is a template that you can use: Homework Template .
Week | Topic | Homework |
---|---|---|
Week 1 | Models of Computation, Time and Space Complexity |
Homework 1 LaTeX Source |
Week2 | Non-determinism |
Homework 2 LaTeX Source |
Week 3 | CLASS CANCELLED. | No Homework |
Week 4 | Circuits, Uniformity and advice, the NC hierarchy |
Homework 3 LaTeX Source |
Week 5 | Randomness: ranomized complexity classes, error reduction, pseudo-randomnumber generators. |
Homework 4 LaTeX Source |
Week 6 | Randomness: error-correcting codes, transforming worst-case hardness into average-case hardness. | - |
Week 7 | Alternation and the Polynomial Hierarchy |
Homework 5 LaTeX Source |
Week 8 | Interactive Complexity Classes | - |
Week 9 | Probabilistically Checkable Proofs and Hardness of Approximation |
Homework 6 LaTeX Source |
Week 10 | Counting Complexity Classes, Relativization and Natural Proofs |
Homework 7 LaTeX Source |