Theory of Computing 2018 2019: различия между версиями
Перейти к навигации
Перейти к поиску
Bbauwens (обсуждение | вклад) Нет описания правки |
Bbauwens (обсуждение | вклад) Нет описания правки |
||
| Строка 5: | Строка 5: | ||
== Dates and Deadlines == | == Dates and Deadlines == | ||
Homework 1, deadline: 2 Oktober | Homework 1, deadline: 2 Oktober, before the lecture. | ||
== Course Materials == | == Course Materials == | ||
Версия от 16:56, 18 сентября 2018
General Information
Dates and Deadlines
Homework 1, deadline: 2 Oktober, before the lecture.
Course Materials
| Date | Summary | Problem list |
|---|---|---|
| 4/9 | Time and space hierarchy theorems (see also Sipser Section 9.1) | Problem list 1 |
| 11/9 | Complexity class NP. Examples. Inclusions between P, NP and EXP. Non-deterministic TMs. Another definition of NP. Polynomial reductions, their properties. NP-hardness and NP-completeness, their properties. | Problem list 2 |
| 18/9 | NP-completeness: Circuit-SAT, 3-SAT, NAE-3-SAT, IND-SET | Problem list 3 |
In the first lectures, we follow Sipser's book Introduction to the theory of computation, chapters 7-9.
Office hours
| Person | Monday | Tuesday | Wednesday | Thursday | Friday | |
|---|---|---|---|---|---|---|
| Vladimir Podolskii, room 621 | 18:00–19:00 | 16:40–18:00 | ||||
| Bruno Bauwens, room 620 | 16:40–19:00 | 15:00–18:00 |