Theoretical Computer Science 2022 — различия между версиями
Материал из Wiki - Факультет компьютерных наук
Bbauwens (обсуждение | вклад) |
Bbauwens (обсуждение | вклад) |
||
| Строка 52: | Строка 52: | ||
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || || || 14:00-20:00 | | [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || || || 14:00-20:00 | ||
|} | |} | ||
| + | Warn me in advance by email. | ||
Версия 12:16, 3 февраля 2022
Содержание
Classes
Wednesdays 18:10–21:00, on zoom
Teacher: Bruno Bauwens
Grading
Exam: 40%
Homework: 20%
Project: 40%
There are 3 homeworks with deadlines: 16.02, 23.02, 02.03, before the lecture
Course Materials
The main reference for the first 4 lectures is Sipser's book "Introduction to the theory of computation", chapters 1, 2–7.
| Video | Summary | Notes |
|---|---|---|
| 19.01 | Regular languages: (non)deterministic automata and their equivalence, pumping lemma, closure properties | lecture 1 |
| 25.01 | Turing machines, undecidability of: Halting program, Wang tiling, Fractran | lecture 2.A lecture 2.B (drafts) |
| 09.02 | Godel's incompleteness theorems, classes P and NP | |
| 16.02 | NP-hardness, EXP, PSPACE, PSPACE-hardness, BPP, Polynomial time hierarchy | |
| 23.02 | Parameterized complexity (1): the class FPT and kernelization | |
| 02.03 | Parameterized complexity (2): W-hierarchy, graph domination | |
| 09.03 | Projects | |
| 16.03 | Projects | |
| 23.03 | Final exam |
Office hours
| Person | Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|---|
| Bruno Bauwens, S834, Zoom | 14:00-20:00 |
Warn me in advance by email.
