|
Semester Date |
Class |
Topics/Chapters Covered |
Assigned |
Due |
|
|
1 |
Introduction to complexity theory. Models of computation and computational problems. |
|
|
|
|
2 |
Basic resources for computation: time, space, nondeterminism. Associated complexity classes. |
|
|
|
|
3 |
Basic resources and classes continued. |
|
|
|
|
4 |
Basic resources and classes continued. |
|
|
|
|
5 |
Basic resources and classes continued. |
|
|
|
|
6 |
Relationships among resources: P vs NP, time versus space, etc. |
|
|
|
|
7 |
Relationships among resources continued. |
|
|
|
|
8 |
Relationships among resources continued. |
Homework #1 |
|
|
|
9 |
Reductions and completeness: NP completeness, PSPACE completeness, etc. Reductions and completeness continued. |
|
|
|
|
10 |
Reductions and completeness continued. |
|
|
|
|
11 |
Reductions and completeness continued. |
|
|
|
|
12 |
Reductions and completeness continued. |
Homework #2 |
|
|
|
13 |
Reductions and completeness continued. |
|
|
|
|
14 |
Counting problems, #P. |
|
|
|
|
15 |
Counting problems, #P continued. |
|
|
|
|
16 |
Randomness as a computational resource; associated complexity classes. |
Homework #3 |
|
|
|
17 |
Randomness continued. |
|
|
|
|
18 |
Randomness continued. |
|
|
|
|
19 |
Nonuniform models of computation; circuit complexity; lower bounds. |
|
|
|
|
20 |
Nonuniform models, circuits, lower bounds continued. |
Homework #4 |
|
|
|
21 |
Nonuniform models, circuits, lower bounds continued. |
|
|
|
|
22 |
Nonuniform models, circuits, lower bounds continued. |
|
|
|
|
23 |
Communication complexity. |
|
|
|
|
24 |
Communication complexity. |
Homework #5 |
|
|
|
25 |
Communication complexity. |
|
|
|
|
26 |
Interactive proofs, IP = PSPACE |
|
|
|
|
27 |
Interactive proofs, IP = PSPACE |
|
|
|
|
28 |
Probabilistically checkable proofs and hardness of approximation. |
Take-home final (due |
Homework #6 |