HONORS THEORY OF COMPUTATION
SPRING 2000
Chee Yap

SCHEDULE OF LECTURES
Week TOPIC BOOK CHAPTER DATE
1 Introduction 1 Jan 19 (First Class)
2 Turing Model 2 Jan 24, 26
3 Computability 3 Jan 31, Feb 1
4 Basic Complexity Relationships 7 Feb 7, 9
5 Reducibility 8 Feb 14, 16
6 Class NP 9 Feb 21, 23
7 Class co-NP 10 Feb 28, Mar 1
8 Randomness 11 Mar 6, 8
-- Spring Break   Mar 13 -- 17
9 Cryptography, Midterm 12 Mar 20, 22
10 Approximation 13 Mar 27, 29
11 P versus NP 14 Apr 3, 5
12 Classes within P 15, 16 Apr 10, 12
13 Polynomial Hierarchy 17 Apr 17, 19
14 Counting Classes 18 Apr 23, 25
15 Review -- May 1 (Last Class)
-- Final Exam -- May 3--10