Theory of Computing

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

General Information


Course materials

Summary Problem list
Complexity classes P, PSPACE, EXP. Time and space hierarchy theorems (see also Sipser Section 9.1) Problem list 1 Updated: 11.09.17
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. Problem list 2
NP-completeness: NAE-3-SAT, Exactly-1-3-SAT, IND-SET, Subset-SUM, 3-COLORING. Problem list 3

Office hours

Person Monday Tuesday Wednesday Thursday Friday
Vladimir Podolskii 16:40–18:00, room 621
Bruno Bauwens 15:05–18:00, room 620 15:05–18:00, room 620