Tik-79.240 Special Course on Computational Complexity

Program Autumn 2000


(Home assignments from Papadimitriou's book).
13.9.2000
Introduction (IN)
Chapter 2: Basics of Turing machines (IN)
Home assignments: 1.4.10 (b),(c),(d),(g) and 2.8.8 (a)
20.9.2000
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)
27.9.2000
Chapter 4 & 7: Boolean Logic; relations between complexity classes (IN)
Home assignments: 4.4.5 and 7.4.5
4.10.2000
Chapter 8: Reductions and completeness (IN)
Home assignments: 8.4.2 and 8.4.3
11.10.2000 (Seminar talks start)
Chapter 9: NP-complete problems
pp. 181-188, Kaski
pp. 188-193, Pääkkönen
pp. 193-199,
Home assignments: 9.5.2 and 9.5.6
18.10.2000
pp. 199-206, Pääkkönen
Chapter 10: coNP and function problems
pp. 219-227, Tarkkala
pp. 227-234, Tarkkala
Home assignments: 9.5.7 and 9.5.10 (a)
25.10.2000
Chapter 11: Randomized computation
pp. 241-248, Jokitalo
pp. 248-256, Wallen
pp. 256-263, Pyhälä
Home assignments: 10.4.13 and 10.4.19 (a)
1.11.2000
pp. 263-271,
Chapter 12: Cryptography
pp. 279-287, Luukkala
pp. 287-293, Pyhälä
Home assignments: 11.5.14 and 11.5.16 (a)
8.11.2000
Chapter 13: Approximability
pp. 299-307, Jokitalo
pp. 307-315, Wallen
pp. 315-322, Aavikko
Home assignments: 12.3.9 (b) and 13.4.13 (a)
15.11.2000
Chapters 14-16 (IN)
Home assignments: 14.5.5 (only the KNAPSACK part) and 15.5.9 (a)
22.11.2000
Chapter 17: The Polynomial Hierarchy
pp. 411-418, Aavikko
pp. 418-424, IN
pp. 424-432, Kaski
Home assignments: 17.3.2 (a), (b) and 17.3.12
29.11.2000
Chapter 18: Computation that Counts
pp. 439-447, Luukkala
pp. 447-451, Meri
Chapter 19: Polynomial Space
pp. 455-462, Meri
Home assignments: 18.3.6 and 19.4.5
4.12.2000
Chapter 20: A glimpse beyond
pp. 491-498,
Course summary and feedback session
Home assignments: 9.5.18 (a), (b) and 9.5.34 (a)