Tik-79.240 Special Course on Computational Complexity

Program Autumn 2002


(Home assignments from Papadimitriou's book).
11.9.2002
Introduction (IN)
Chapter 2: Basics of Turing machines (IN)
Home assignments: 1.4.10 (b),(c),(d),(g) and 2.8.8 (a)
18.9.2002
No lectures
25.9.2002
Chapter 2 & 3: More on Turing machines, time and space complexity, undecidability (IN)
Home assignments: 2.8.18 (a) and 3.4.1 (b), (c) and (g)
2.10.2002
Chapter 4 & 7: Boolean logic; relations between complexity classes (IN)
Home assignments: 4.4.5 and 7.4.5
9.10.2002
Chapter 8: Reductions and completeness (IN)
Home assignments: 8.4.2 and 8.4.3
16.10.2002
Chapter 9: NP-complete problems (IN)
Home assignments: 9.5.2 and 9.5.6
23.10.2002
Chapter 9: NP-complete problems - cont'd (IN)
Chapter 10: coNP and function problems (IN)
Home assignments: 9.5.7 and 9.5.10 (a)
30.10.2002
Chapter 11: Randomized computation (Seminar talks begin)
pp. 241-248, Rosti
pp. 248-256, IN
pp. 256-263, IN
Home assignments: 10.4.13 and 10.4.19 (a)
6.11.2002
pp. 263-271, IN
Chapter 12: Cryptography
pp. 279-287, Larvala
pp. 287-293, Dubrovin
Home assignments: 11.5.14 and 11.5.16 (a)
13.11.2002
Chapter 13: Approximability
pp. 299-307, Lönnberg
pp. 307-315, Kirichenko
pp. 315-322, Hakala
Home assignments: 12.3.9 (b) and 13.4.13 (a)
20.11.2002
Chapters 14-16: On P vs. NP; Parallel Computation; Log Space (IN)
Home assignments: 14.5.5 (only the KNAPSACK part) and 15.5.9 (a)
27.11.2002
Chapter 17: The Polynomial Hierarchy
pp. 411-418, IN
pp. 418-424, IN
pp. 424-432, Asikainen
Home assignments: 17.3.2 (a), (b) and 17.3.12
4.12.2002
Chapter 18: Computation that Counts
pp. 439-447, IN
pp. 447-451, IN
Chapter 19: Polynomial Space (IN)
Home assignments: 18.3.6 and 19.4.5
5.12.2002 (14-16, room A232)
Chapter 20: A Glimpse Beyond (IN)
Course summary and feedback session
Home assignments: 9.5.18 (a), (b) and 9.5.34 (a)