Theory of Computing 2018 2019: различия между версиями
Перейти к навигации
Перейти к поиску
Bbauwens (обсуждение | вклад) Нет описания правки |
Bbauwens (обсуждение | вклад) Нет описания правки |
||
| Строка 58: | Строка 58: | ||
|} | |} | ||
In the first lectures, we follow Sipser's book [https://theswissbay.ch/pdf/Book/Introduction%20to%20the%20theory%20of%20computation_third%20edition%20-%20Michael%20Sipser.pdf Introduction to the theory of computation]. | In the first lectures, we follow Sipser's book [https://theswissbay.ch/pdf/Book/Introduction%20to%20the%20theory%20of%20computation_third%20edition%20-%20Michael%20Sipser.pdf Introduction to the theory of computation], chapters 7-9. | ||
Версия от 14:34, 4 сентября 2018
General Information
Dates and Deadlines
Course Materials
| Date | Summary | Problem list |
|---|---|---|
| 3/9 | Time and space hierarchy theorems (see also Sipser Section 9.1) | Problem list 1 |
| 10/9 | Complexity class NP. Examples. Inclusions between P, NP and EXP. Non-deterministic TMs. Another definition of NP. Complexity class NEXP. Polynomial reductions, their properties. NP-hardness and NP-completeness, their properties. NP-completeness: CIRC-SAT, 3-SAT. |
In the first lectures, we follow Sipser's book Introduction to the theory of computation, chapters 7-9.