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

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск
Строка 22: Строка 22:
 
  || 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. || [http://www.mi.ras.ru/~podolskii/files/computability1819/prob_2.pdf Problem list 2 ]
 
  || 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. || [http://www.mi.ras.ru/~podolskii/files/computability1819/prob_2.pdf Problem list 2 ]
 
|-
 
|-
  || 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 || [http://www.mi.ras.ru/~podolskii/files/computability1819/prob_3.pdf Problem list 3]
 
|-
 
|-
  || 25/9 || NP-completeness: Subset-SUM, 3COLORING || [https://www.dropbox.com/s/h5or8izfv7m5pn8/prob_4.pdf?dl=0 Problem list 4]
+
  || 25/9 || NP-completeness: Subset-SUM, 3COLORING || [http://www.mi.ras.ru/~podolskii/files/computability1819/prob_4.pdf  Problem list 4]
 
|-
 
|-
  || 2/10 || 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). || [https://www.dropbox.com/s/0lqvrn7v1updjug/prob_5.pdf?dl=0 Problem list 5]
+
  || 2/10 || 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). || [http://www.mi.ras.ru/~podolskii/files/computability1819/prob_5.pdf Problem list 5]
 +
|-
 +
|| 9/10 || Classes L and NL. Examples. Log-space reductions, their properties. REACHABILITY is NL-complete. NL is equal to coNL (proof is not included in the exams) || [http://www.mi.ras.ru/~podolskii/files/computability1819/prob_6.pdf Problem list 6]
 
<!--
 
<!--
 
|-
 
|-
Строка 65: Строка 67:
  
 
During the first module, we follow Sipser's book [https://theswissbay.ch/pdf/Book/Introduction%20to%20the%20theory%20of%20computation_third%20edition%20-%20Michael%20Sipser.pdf Introduction to the theory of computation], chapters 7-9.
 
During the first module, we follow Sipser's book [https://theswissbay.ch/pdf/Book/Introduction%20to%20the%20theory%20of%20computation_third%20edition%20-%20Michael%20Sipser.pdf Introduction to the theory of computation], chapters 7-9.
 
 
  
 
== Office hours ==
 
== Office hours ==

Версия 20:12, 9 октября 2018

General Information

Grading

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.

Homework results

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
2/10 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). Problem list 5
9/10 Classes L and NL. Examples. Log-space reductions, their properties. REACHABILITY is NL-complete. NL is equal to coNL (proof is not included in the exams) Problem list 6

During the first module, 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