Lecture
|
Date
|
Topics
|
Reading
|
1
|
1/18
|
Introduction. Problems,
Algorithms, Models
|
Ch.1
|
2
|
1/23
|
Basic models and resources:
Turing machines, RAM, nondeterminism, time, space
|
Ch 2
|
3
|
1/25
|
Basic models and resources
ctd.
|
Ch 2
|
4
|
1/30
|
Basic models and resources
ctd.
|
Ch 2
|
5
|
2/1
|
Basic models and resources
ctd. |
Ch 2
|
6
|
2/6
|
Relations between complexity
classes |
Ch. 7
|
7
|
2/8
|
Relations ctd.
|
Ch. 7
|
8
|
2/13
|
Relations ctd. |
Ch. 7
|
9
|
2/15
|
Hierarchy theorems
|
Ch. 7
|
10
|
2/20
|
Reductions and completeness |
Ch. 4,8
|
11
|
2/22
|
Graph reachability,
NL-completeness
|
Ch. 8
|
12
|
2/27
|
Boolean functions &
circuits, P-completeness |
Ch. 4,8 |
13
|
2/29
|
Satisfiability,
NP-completeness
|
Ch. 9
|
14
|
3/5
|
Optimization problems and
NP-completeness |
Ch. 9
|
15
|
3/7
|
More NP-complete problems,
problems with numbers
|
Ch. 9
|
16
|
3/19
|
coNP and function problems,
NP intersect coNP |
Ch. 10
|
17
|
3/21
|
Randomized algorithms and
complexity classes |
Ch. 11
|
18
|
3/26
|
Randomized classes ctd
|
Ch. 11
|
19
|
3/28
|
Circuit complexity |
Ch. 11, 14
|
20
|
4/2
|
Oracles, Relativization |
Ch. 14
|
21
|
4/4
|
Polynomial Hierarchy |
Ch. 17
|
22
|
4/9
|
PH, Alternation
|
Ch. 17
|
23
|
4/11
|
PSPACE and
PSPACE-completeness |
Ch. 19
|
24
|
4/16
|
PSPACE complete problems |
Ch. 19
|
25
|
4/18
|
Counting problems and #P |
Ch 18
|
26
|
4/23
|
Interactive proof systems |
Ch.19
|
27
|
4/25
|
Approximability and
probabilistically checkable proofs |
Ch. 13
|
28
|
4/30
|
Parallel algorithms and the
class NC, Exponential time and beyond
|
Ch. 15, 20 |
|
5/7
|
Final Exam: 1:10 - 4:00 pm
|
|