Theory of Computing 2018 2019

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск

General Information

Grading

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. Polynomial reductions, their properties. NP-hardness and NP-completeness, their properties.

In the first lectures, we follow Sipser's book Introduction to the theory of computation, chapters 7-9.