CS221 Lectures
If you are scribing, look up template.tex
. You'll need macros.tex
. Please check spelling and grammar.
Lectures so far:
Lecture 01 (9/18): Introduction.
Lecture 02 (9/20):
Turing Machines, Computational Problems and Complexity Measures
(ps)
(pdf).
Lecture 03(9/25) (unedited):
Last Comments on Turing Machines, Time Hierarchy
(doc).
Lecture 04 (9/27):
More Hierarchy Theorems
(ps)
(pdf).
Lecture 05 (9/30):
Space, Nondeterminism
(ps)
(pdf).
Lecture 06 (10/2):
Nondeterminism, Nondeterministic Time Hierarchy, Relations between Resources
(ps)
(pdf).
Lecture 07 (10/4):
Completeness
(ps)
(pdf).
Lecture 08 (10/7):
Completeness, NL
(ps)
(pdf).
Lecture 09 (10/9):
Savitch's theorem, NL=co-NL
(ps)
(pdf).
Lecture 10 (10/11):
Alternation, PSPACE=AP
(ps)
(pdf).
Lecture 11 (10/16):
Alternation, PSPACE, Geography is PSPACE-complete
(ps)
(pdf).