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

Версия от 16:52, 18 сентября 2018

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

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

	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–18:00	15:00–18:00

@@ Строка 61: / Строка 61: @@
 In the first lectures, 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 ==
+{| class="wikitable"
+|-
+! !! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
+|-
+| <center>1</center> || Vladimir Podolskii, room&nbsp;621 ||  || 18:00&ndash;19:00 || 16:40&ndash;18:00  ||  ||
+|-
+| <center>2</center> || Bruno Bauwens, room&nbsp;620 || 16:40&ndash;18:00 || 15:00&ndash;18:00 || ||
+|}