Theory of Computing 2019 2020

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск

General Information

Classes: Fridays, 15:10-18:00, R406


Dates and Deadlines

Homework 1, deadline: 4 October, before the lecture

Course Materials

In the first several lecture we follow Sipser's book "Introduction to the theory of computation"

If you need some background in math, consider these two sourses:
Lecure notes: Discrete Mathematics, L. Lovasz, K. Vesztergombi
Лекции по дискретной математике (черновик учебника, in Russian)

Date Summary Problem list
06.09 Turing machines, multitape Turing machines, connection between them. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. Problem list 1 Updated: 07.09.19
13.09 Universal Turing machine. Space hierarchy theorem. Space constructable functions. Problem list 2
20.09 Complexity class NP. Examples. Inclusions between P, NP and PSPACE. Non-deterministic TMs. Another definition of NP. Polynomial reductions, their properties. NP-hardness and NP-completeness, their properties. Problem list 3
27.09 Circuit complexity. Examples. All functions are computed by circuits. Existence of functions with exponential circuit complexity. P is in P/poly. Problem list 4
04.10 NP-completeness: Circuit-SAT, 3-SAT, IND-SET, BIN-INT-PROG Problem list 5
11.10 NP-completeness: Subset-SUM, 3COLORING. coNP, completeness of CIRC-TAUT Problem list 6

For interested students: lecture notes on quantum computation

Office hours

Person Monday Tuesday Wednesday Thursday Friday
Vladimir Podolskii, room S830
Bruno Bauwens, room S834