Theory of Computing 2018 2019: различия между версиями
Перейти к навигации
Перейти к поиску
Bbauwens (обсуждение | вклад) Нет описания правки |
Bbauwens (обсуждение | вклад) Нет описания правки |
||
| Строка 13: | Строка 13: | ||
! Date !! Summary !! Problem list | ! Date !! Summary !! Problem list | ||
|- | |- | ||
|| | || 4/9 || Time and space hierarchy theorems (see also Sipser Section 9.1) || [http://www.mi.ras.ru/~podolskii/files/computability1819/prob_1.pdf 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. || [http://www.mi.ras.ru/~podolskii/files/computability1819/prob_2.pdf Problem list 2 ] | ||
|- | |- | ||
|| NP-completeness: Circuit-SAT, 3-SAT, NAE-3-SAT, IND-SET || [https://www.dropbox.com/s/8nisqdaia715ib0/prob_3.pdf?dl=0 Problem list 3] | || 18/9 || NP-completeness: Circuit-SAT, 3-SAT, NAE-3-SAT, IND-SET || [https://www.dropbox.com/s/8nisqdaia715ib0/prob_3.pdf?dl=0 Problem list 3] | ||
<!-- | <!-- | ||
[http://www.mi.ras.ru/~podolskii/files/computability/prob_2.pdf Problem list 2] | [http://www.mi.ras.ru/~podolskii/files/computability/prob_2.pdf Problem list 2] | ||
Версия от 16:47, 18 сентября 2018
General Information
Dates and Deadlines
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.