Theory of Computing — различия между версиями
Материал из Wiki - Факультет компьютерных наук
(→Course materials) |
Passick (обсуждение | вклад) (Added section about homeworks) |
||
| Строка 16: | Строка 16: | ||
|| NP-completeness: NAE-3-SAT, Exactly-1-3-SAT, IND-SET, Subset-SUM, 3-COLORING. || [http://www.mi.ras.ru/~podolskii/files/computability/prob_3.pdf Problem list 3] | || NP-completeness: NAE-3-SAT, Exactly-1-3-SAT, IND-SET, Subset-SUM, 3-COLORING. || [http://www.mi.ras.ru/~podolskii/files/computability/prob_3.pdf Problem list 3] | ||
|} | |} | ||
| + | |||
| + | == Homework == | ||
| + | Send homeworks by email to posobin+hw[at]gmail.com, or submit them in person to one of the teachers or the teaching assistant (Gleb Posobin) before the deadline. | ||
== Office hours == | == Office hours == | ||
Версия 14:53, 22 сентября 2017
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 |
Homework
Send homeworks by email to posobin+hw[at]gmail.com, or submit them in person to one of the teachers or the teaching assistant (Gleb Posobin) before the deadline.
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 |
