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 recommended texts and notes from class (either mine, yours or those of another student).
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 1||Languages, Turing Machines, Completeness||-|
|Week2||Complexity Classes||Homework 1|
Non-determinism, Part II
Circuits, Uniformity and advice, NC
|Week 5||Randomness: ranomized complexity classes, error reduction, pseudo-randomnumber generators.||Homework 3|
|Week 6||Alternation and the Polynomial Hierarchy.||-|
|Week 7||Complexity of Counting.||Homework 4|
|Week 8||Interactive Complexity Classes||-|
Intro to PCP and Hardness of Approximation
NP contained in PCP[ poly, 1 ]
|Week 10||Probabilistically Checkable Proofs and Hardness of Approximation||Homework 5|