Theory of Computing
Материал из Wiki - Факультет компьютерных наук
Версия от 15:58, 9 сентября 2017; Vpodolskii (обсуждение | вклад)
General Information
Course materials
| Summary | Problem list |
|---|---|
| Problem list 1 | |
| 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 |
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 | |||
| |
Gleb Posobin |
