Theory of Computing 2018 2019 — различия между версиями

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск
Строка 19: Строка 19:
 
|-
 
|-
 
  || 18/9 || NP-completeness: Circuit-SAT, 3-SAT, NAE-3-SAT, IND-SET || [https://www.dropbox.com/s/8nisqdaia715ib0/prob_3.pdf?dl=0 Problem list 3]
 
  || 18/9 || NP-completeness: Circuit-SAT, 3-SAT, NAE-3-SAT, IND-SET || [https://www.dropbox.com/s/8nisqdaia715ib0/prob_3.pdf?dl=0 Problem list 3]
 +
|-
 +
|| 25/9 || NP-completeness: Subset-SUM, 3COLORING || [https://www.dropbox.com/s/h5or8izfv7m5pn8/prob_4.pdf?dl=0  Problem list 4]
 
<!--
 
<!--
[http://www.mi.ras.ru/~podolskii/files/computability/prob_2.pdf Problem list 2]
 
|-
 
|| 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]
 
|-
 
 
  || Space complexity. Classes PSPACE and NPSPACE. Configuration graph. Inclusions between time and space classes. TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) (additional material). Interpretation of PSPACE in terms of games. || [http://www.mi.ras.ru/~podolskii/files/computability/prob_4.pdf Problem list 4]
 
  || Space complexity. Classes PSPACE and NPSPACE. Configuration graph. Inclusions between time and space classes. TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) (additional material). Interpretation of PSPACE in terms of games. || [http://www.mi.ras.ru/~podolskii/files/computability/prob_4.pdf Problem list 4]
 
|-
 
|-

Версия 18:53, 25 сентября 2018

General Information

Grading

Dates and Deadlines

Homework 1, deadline: 2 Oktober, before the lecture.

Course Materials

Date Summary Problem list
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

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


Office hours

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