Содержание

Classes

Wednesdays 18:10–21:00, in room S834.

Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.

For practical information ask to join the telegram group.

Video	Summary	Notes	Homework
08.02	Regular languages 1: deterministic automata, pumping lemma, closure properties	lecture 1 & 2	hw1
15.02	Regular languages 2: nondeterministic automata and regular expressions		hw2
01.03	Chapter 1 of discrete math for computer science (see 1st book below). Turing machines	Turing machines	hw3
16.03	Recursion and induction. (Chapt 3 of discrete math book.) Turing machines.		hw4
23.03	Invariants (Chapt 5). Undecidability	lecture 3.A	hw5
29.03	Completeness	3.B	hw6
12.04	(online, in zoom) The classes P, EXP, PSPACE, EXPSPACE. Time and space hierarchy theorems.	See Sipser chapts 7 and 8	hw7
19.04	The class NP, NP-completeness, reduction from SAT to IND-SET	notes	hw8
26.04	Reductions. Proof of the Levin-Cook theorem.	circuits reductions	hw9
17.05	Exam. Start at 16h00. Theory questions. Also solve 4 exercises as in the homework, including 1 NP-completeness proof.

Homework: 35%

Theory exam: 35%

Problem solving exam: 30%

Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.

Basic math

Golovnev, Kulikov, Podolskii, Shen, Discrete mathematics for computer science, 2020.

Computational complexity

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

Mathematical writing

Knuth, Technical writing, transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.

Person	Monday	Tuesday	Wednesday	Thursday	Friday
Bruno Bauwens, S834, Zoom			14:00-18:00

Warn me in advance by email.