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

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск
Строка 61: Строка 61:
 
  || [https://www.dropbox.com/s/3e1as6lok0h1oxw/prob_12.pdf?dl=0 Problem list 12]
 
  || [https://www.dropbox.com/s/3e1as6lok0h1oxw/prob_12.pdf?dl=0 Problem list 12]
 
|-
 
|-
  || 4/12 || Probabilistic versus deterministic complexity. Newman's theorem. Space-time tradeoffs for Turing machines. Lower bound for randomized 1-shot communication complexity of set disjointness (see Roughgarden's lecture notes).  
+
  || 4/12 || Probabilistic versus deterministic complexity. Newman's theorem. Space-time tradeoffs for Turing machines. See Nisan Kushilevich chapters 3 and 12. Lower bound for randomized 1-shot communication complexity of set disjointness, see Roughgarden's [http://theory.stanford.edu/~tim/w15/l/l2.pdf lecture notes]).  
 
  || [https://www.dropbox.com/s/nsa2tped7qp39ch/prob_13.pdf?dl=0 Problem list 13]
 
  || [https://www.dropbox.com/s/nsa2tped7qp39ch/prob_13.pdf?dl=0 Problem list 13]
<!--
 
|-
 
|| Randomized communication complexity of IP. Streaming algorithms. Finding the majority element. Deciding whether there is a most frequent element is hard. One-sided probabilistic complexity of disjointness.
 
|| [http://www.mi.ras.ru/~podolskii/files/computability/prob_10.pdf Problem list 10] <span style="color:red">Updated: 22.11.17</span>
 
|-
 
|| Property testing: definitions, testing of halfplanes, sorted listed, connectedness of graphs, testing of linearity.  [https://www.dropbox.com/s/r35jr22fb3lfo3k/propTest.pdf?dl=0 Lecture notes.] Version 25.11.17
 
|| [https://www.dropbox.com/s/uzh9dur6aiy88dl/prob_11.pdf?dl=0 Problem list 11] <span style="color:red">Updated: 22.11.17</span>
 
|-
 
|| Property testing: connectedness of graphs (cont.) and testing of monotonicity.  (See notes from the previous lecture.)
 
|| [https://www.dropbox.com/s/y2xujzeftsg6zlr/prob_12.pdf?dl=0 Problem list 12]
 
|-
 
|| Property testing: lower bounds for monotonicity (see Sect 4 [http://theory.stanford.edu/~tim/w15/l/l8.pdf here]) and k-linearity using communication complexity. Approximation algorithms for some NP-complete problems (see seminar).
 
|| [https://www.dropbox.com/s/5xsxqv098y5wmx0/prob_13.pdf?dl=0 Problem list 13]
 
|-
 
|| The class PCP: definition, basic properties, and relation to with the MAX-Clique approximation problem. Beginning of the proof that NP is a subset of PCP(poly(n), 1). See Dexter Kozen, "Introduction to the theory of computation", lectures 18-20 (or see the book of Arora and Barak, chapter 11).
 
|| [https://www.dropbox.com/s/gbg30ajwes45ne8/prob_14.pdf?dl=0 Problem list 14]
 
|-
 
|| NP is a subset of PCP(poly(n),1) [continued]. Solutions of some extra problems.
 
|| No problem list.
 
-->
 
 
|}
 
|}
  

Версия 17:09, 4 декабря 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 October

Homework 2, deadline: 6 November

Homework 3, deadline: 4 December

Before the lecture.

Colloquium

Date and time: December 10, 16:40
Room: 400
Program

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
16/10 Interpretation of PSPACE in terms of games. Probabilistic computation. Probabilistic machines, the class BPP, prime testing and Carmichael numbers, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Problem list 7
30/10 Computations with oracles, its simple properties. There are oracles A and B such that P^A is equal to NP^A and P^B is not equal to NP^B. Problem list 8
6/11 Circuit complexity: directed reachability in AC1, NC0 is trivial, polynomial size Boolean formulas equal NC_1, relations with L and NL. Lecture notes Problem list 9
13/11 Streaming algorithms: finding the majority element, computation of moments F_0 and F_2 in logarithmic space, lower-bounds using one-shot communication complexity. Roughgarden's lecture notes Problem list 10
20/11 Communication protocols. Functions EQ, GT, DISJ, IP. Fooling sets. Combinatorial rectangles. Rectangle size lower bound. Rank lower bound. Book: Nisan Kushilevich: communication complexity, 1997 Problem list 11
27/11 Nondeterministic communication complexity. D(f) < O(N^0(f) N^1(f)). Deterministic complexity vs number of leafs in a protocol tree. Randomized communication complexity: definitions. Functions EQ, GT, MCE. Problem list 12
4/12 Probabilistic versus deterministic complexity. Newman's theorem. Space-time tradeoffs for Turing machines. See Nisan Kushilevich chapters 3 and 12. Lower bound for randomized 1-shot communication complexity of set disjointness, see Roughgarden's lecture notes). Problem list 13

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