Theory of Computing 2018 2019
Send your home assignments only in pdf format to the teacher assistant (Andrey Storozhenko) by email (storozhenkoaa [at] yandex.ru) with the following subject: "[Computing, Name Surname, HWx]". You can also submit them in person before the deadline.
Dates and Deadlines
Homework 1, deadline: 2 Oktober, before the lecture.
|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|
|25/9||NP-completeness: Subset-SUM, 3COLORING||Problem list 4|
During the first module, we follow Sipser's book Introduction to the theory of computation, chapters 7-9.
||Vladimir Podolskii, room 621||18:00–19:00||16:40–18:00|
||Bruno Bauwens, room 620||16:40–19:00||15:00–18:00|