Wiki - Факультет компьютерных наук - Вклад [ru]

Theoretical computer science spring 2023

2023-03-29T15:12:45Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.

For practical information ask to join the telegram group.

[https://www.dropbox.com/scl/fi/2opgvanhsuuqyrt1z5zhl/scores.ods?dl=0&rlkey=v0htrtejs04c1pujinri7ozqj Scores]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]
|-
|| 01.03 || Chapter 1 of discrete math for computer science (see 1st book below). Turing machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 Turing machines] || [https://www.dropbox.com/s/f3q0q0378y1o2y6/3_HW.pdf?dl=0 hw3]
|-
|| 16.03 || Recursion and induction. (Chapt 3 of discrete math book.) Turing machines. || || [https://www.dropbox.com/s/ee0kaxd8wrr5k7b/4_HW.pdf?dl=0 hw4]
|-
|| 23.03 || Invariants (Chapt 5). Undecidability || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] || [https://www.dropbox.com/s/17ogtcftqh7ybzo/5_HW.pdf?dl=0 hw5]
|-
|| 29.03 || Completeness || [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 12.04 || (online, in zoom) The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. NP-completeness, || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] ||
|-
|| 19.04 || circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] ||
|-
|| 26.04 || Reductions. The classes RP, coRP and BPP, primes in BPP ||[https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| || Exam
|}

= Grading =

Homework: 35%

Theory exam: 35%

Problem solving exam: 30%

Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.

= References =

'''Basic math'''

Golovnev, Kulikov, Podolskii, Shen, Discrete mathematics for computer science, 2020.

[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi

[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-03-24T15:52:15Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.

For practical information ask to join the telegram group.

[https://www.dropbox.com/scl/fi/2opgvanhsuuqyrt1z5zhl/scores.ods?dl=0&rlkey=v0htrtejs04c1pujinri7ozqj Scores]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]
|-
|| 01.03 || Chapter 1 of discrete math for computer science (see 1st book below). Turing machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 Turing machines] || [https://www.dropbox.com/s/f3q0q0378y1o2y6/3_HW.pdf?dl=0 hw3]
|-
|| 16.03 || Recursion and induction. (Chapt 3 of discrete math book.) Turing machines. || || [https://www.dropbox.com/s/ee0kaxd8wrr5k7b/4_HW.pdf?dl=0 hw4]
|-
|| 23.03 || Invariants (Chapt 5). Undecidability || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] || [https://www.dropbox.com/s/17ogtcftqh7ybzo/5_HW.pdf?dl=0 hw5]
|-
|| 29.03 || Completeness || [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 12.04 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. NP-completeness, || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] ||
|-
|| 19.04 || circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] ||
|-
|| 26.04 || Reductions. The classes RP, coRP and BPP, primes in BPP ||[https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| || Exam
|}

= Grading =

Homework: 35%

Theory exam: 35%

Problem solving exam: 30%

Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.

= References =

'''Basic math'''

Golovnev, Kulikov, Podolskii, Shen, Discrete mathematics for computer science, 2020.

[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi

[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-03-24T15:51:46Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.

For practical information ask to join the telegram group.

[https://www.dropbox.com/scl/fi/2opgvanhsuuqyrt1z5zhl/scores.ods?dl=0&rlkey=v0htrtejs04c1pujinri7ozqj Scores]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]
|-
|| 01.03 || Chapter 1 of discrete math for computer science (see 1st book below). Turing machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 Turing machines] || [https://www.dropbox.com/s/f3q0q0378y1o2y6/3_HW.pdf?dl=0 hw3]
|-
|| 16.03 || Recursion and induction. (Chapt 3 of discrete math book.) Turing machines. || || [https://www.dropbox.com/s/ee0kaxd8wrr5k7b/4_HW.pdf?dl=0 hw4]
|-
|| 23.03 || Invariants (Chapt 5). Undecidability || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] || [https://www.dropbox.com/s/17ogtcftqh7ybzo/5_HW.pdf?dl=0 hw5]||
|-
|| 29.03 || Completeness || [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 12.04 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. NP-completeness, || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] ||
|-
|| 19.04 || circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] ||
|-
|| 26.04 || Reductions. The classes RP, coRP and BPP, primes in BPP ||[https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| || Exam
|}

= Grading =

Homework: 35%

Theory exam: 35%

Problem solving exam: 30%

Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.

= References =

'''Basic math'''

Golovnev, Kulikov, Podolskii, Shen, Discrete mathematics for computer science, 2020.

[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi

[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-03-24T15:51:10Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.

For practical information ask to join the telegram group.

[https://www.dropbox.com/scl/fi/2opgvanhsuuqyrt1z5zhl/scores.ods?dl=0&rlkey=v0htrtejs04c1pujinri7ozqj Scores]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]
|-
|| 01.03 || Chapter 1 of discrete math for computer science (see 1st book below). Turing machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 Turing machines] || [https://www.dropbox.com/s/f3q0q0378y1o2y6/3_HW.pdf?dl=0 hw3]
|-
|| 16.03 || Recursion and induction. (Chapt 3 of discrete math book.) Turing machines. || || [https://www.dropbox.com/s/ee0kaxd8wrr5k7b/4_HW.pdf?dl=0 hw4]
|-
|| 23.03 || Invariants (Chapt 5). Undecidability || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] || [https://www.dropbox.com/s/17ogtcftqh7ybzo/5_HW.pdf?dl=0 hw5]||
|-
|| 29.03 || Completeness || [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 12.04 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. NP-completeness, || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] ||
|-
|| 19.04 || circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] ||
-
|| 26.04 || Reductions. The classes RP, coRP and BPP, primes in BPP ||[https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| || Exam
|}

= Grading =

Homework: 35%

Theory exam: 35%

Problem solving exam: 30%

Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.

= References =

'''Basic math'''

Golovnev, Kulikov, Podolskii, Shen, Discrete mathematics for computer science, 2020.

[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi

[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-03-24T15:50:14Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.

For practical information ask to join the telegram group.

[https://www.dropbox.com/scl/fi/2opgvanhsuuqyrt1z5zhl/scores.ods?dl=0&rlkey=v0htrtejs04c1pujinri7ozqj Scores]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]
|-
|| 01.03 || Warmup in discrete math: Chapter 1 of discrete math for computer science (see 1st book below). Turing machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 Turing machines] || [https://www.dropbox.com/s/f3q0q0378y1o2y6/3_HW.pdf?dl=0 hw3]
|-
|| 16.03 || Warmup: Recursion and induction. (Chapt 3 of discrete math book.) Turing machines. || || [https://www.dropbox.com/s/ee0kaxd8wrr5k7b/4_HW.pdf?dl=0 hw4]
|-
|| 23.03 || Invariants (Chapt 5). Undecidability || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] || [https://www.dropbox.com/s/17ogtcftqh7ybzo/5_HW.pdf?dl=0 hw5]||
|-
|| 29.03 || Completeness || [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 12.04 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. NP-completeness, || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] ||
|-
|| 19.04 || circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] ||
-
|| 26.04 || Reductions. The classes RP, coRP and BPP, primes in BPP ||[https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| || Exam
|}

= Grading =

Homework: 35%

Theory exam: 35%

Problem solving exam: 30%

Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.

= References =

'''Basic math'''

Golovnev, Kulikov, Podolskii, Shen, Discrete mathematics for computer science, 2020.

[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi

[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-03-17T17:02:02Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.

For practical information ask to join the telegram group.

[https://www.dropbox.com/scl/fi/2opgvanhsuuqyrt1z5zhl/scores.ods?dl=0&rlkey=v0htrtejs04c1pujinri7ozqj Scores]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]
|-
|| 01.03 || Warmup in discrete math: Chapter 1 of discrete math for computer science (see 1st book below). Turing machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 Turing machines] || [https://www.dropbox.com/s/f3q0q0378y1o2y6/3_HW.pdf?dl=0 hw3]
|-
|| 16.03 || Warmup: Recursion and induction. (Chapt 3 of discrete math book.) Turing machines. || || [https://www.dropbox.com/s/ee0kaxd8wrr5k7b/4_HW.pdf?dl=0 hw4]
|-
|| 23.03 || Undecidability and completeness || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 29.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 05.04 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| || Exam
|}

= Grading =

Homework: 35%

Theory exam: 35%

Problem solving exam: 30%

Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.

= References =

'''Basic math'''

Golovnev, Kulikov, Podolskii, Shen, Discrete mathematics for computer science, 2020.

[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi

[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-03-02T20:30:38Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.

For practical information ask to join the telegram group.

[https://www.dropbox.com/scl/fi/2opgvanhsuuqyrt1z5zhl/scores.ods?dl=0&rlkey=v0htrtejs04c1pujinri7ozqj Scores]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]
|-
|| 01.03 || Warmup in discrete math: Chapter 1 of discrete math for computer science (see 1st book below). Turing machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 Turing machines] || [https://www.dropbox.com/s/f3q0q0378y1o2y6/3_HW.pdf?dl=0 hw3]
|-
|| 15.03 || Undecidability and incompleteness || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 22.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 29.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 05.04 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| || Exam
|}

= Grading =

Homework: 35%

Theory exam: 35%

Problem solving exam: 30%

Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.

= References =

'''Basic math'''

Golovnev, Kulikov, Podolskii, Shen, Discrete mathematics for computer science, 2020.

[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi

[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-03-02T20:25:02Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.

For practical information ask to join the telegram group.

[https://www.dropbox.com/scl/fi/2opgvanhsuuqyrt1z5zhl/scores.ods?dl=0&rlkey=v0htrtejs04c1pujinri7ozqj Scores]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]
|-
|| 01.03 || Warmup in discrete math. Chapter 1 of discrete math for computer science, by Golovnev, Kulikov, Podolskii, Shen. Turing machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 Turing machines] || [https://www.dropbox.com/s/f3q0q0378y1o2y6/3_HW.pdf?dl=0 hw3]
|-
|| 15.03 || Undecidability and incompleteness || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 15.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 22.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 29.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 05.04(?) || Exam
|-
|| May || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-17T18:36:59Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.

For practical information ask to join the telegram group.

[https://www.dropbox.com/scl/fi/2opgvanhsuuqyrt1z5zhl/scores.ods?dl=0&rlkey=v0htrtejs04c1pujinri7ozqj Scores]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]
|-
|| 22.02 || Turing machines, the Halting problem, Wang tiling, Fractran, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 01.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 08.03 || Woman's day, no lecture
|-
|| 15.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 22.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 29.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 05.04(?) || Exam
|-
|| May || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-17T18:35:05Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]
|-
|| 22.02 || Turing machines, the Halting problem, Wang tiling, Fractran, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 01.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 08.03 || Woman's day, no lecture
|-
|| 15.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 22.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 29.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 05.04(?) || Exam
|-
|| May || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down.

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-17T17:39:08Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be submitted before the start of the lecture next lecture by email brbauwens -at- gmail.com with tcs in the subject line.

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]
|-
|| 22.02 || Turing machines, the Halting problem, Wang tiling, Fractran, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 01.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 08.03 || Woman's day, no lecture
|-
|| 15.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 22.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 29.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 05.04(?) || Exam
|-
|| May || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-15T08:13:02Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be submitted before the start of the lecture next lecture by email brbauwens -at- gmail.com with tcs in the subject line.

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1 & 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || ||
|-
|| 22.02 || Turing machines, the Halting problem, Wang tiling, Fractran, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 01.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 08.03 || Woman's day, no lecture
|-
|| 15.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 22.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 29.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 05.04(?) || Exam
|-
|| May || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-15T08:11:15Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be submitted before the start of the lecture next lecture by email brbauwens -at- gmail.com with tcs in the subject line.

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || ||
|-
|| 22.02 || Turing machines, the Halting problem, Wang tiling, Fractran, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 01.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 08.03 || Woman's day, no lecture
|-
|| 15.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 22.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 29.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 05.04(?) || Exam
|-
|| May || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T19:46:06Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

Homeworks need to be submitted before the start of the lecture next lecture by email brbauwens -at- gmail.com with tcs in the subject line.

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || ||
|-
|| 22.02 || Turing machines, the Halting problem, Wang tiling, Fractran, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 23.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 30.03(?) || Exam
|-
|| may || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T19:45:40Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

Homeworks need to be submitted before the start of the lecture next lecture by email brbauwens -at- gmail.com with tcs in the subject line.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || ||
|-
|| 22.02 || Turing machines, the Halting problem, Wang tiling, Fractran, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 23.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 30.03(?) || Exam
|-
|| may || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T19:44:29Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

Homeworks need to be submitted before the start of the lecture.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/l764sm569b9ygic/automata.pdf?dl=0 lecture 1] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || ||
|-
|| 22.02 || Turing machines, the Halting problem, Wang tiling, Fractran, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 23.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 30.03(?) || Exam
|-
|| may || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T19:43:20Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

Homeworks need to be submitted before the start of the lecture.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || ||
|-
|| 22.02 || Turing machines, the Halting problem, Wang tiling, Fractran, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 23.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 30.03(?) || Exam
|-
|| may || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:22:49Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1] ||
|-
|| 15.02 || Regular languages 2: nondeterministic automata and regular expressions || ||
|-
|| 22.02 || Turing machines, the Halting problem, Wang tiling, Fractran, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 23.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 30.03(?) || Exam
|-
|| may || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:20:59Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1] ||
|-
|| 15.02 || Regular languages (2): nondeterministic automata and regular expressions] || ||
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem (see Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 23.03 || Reductions. The classes RP, coRP and BPP, primes in BPP || ||
|-
|| 30.03(?) || Exam
|-
|| may || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:17:24Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1] ||
|-
|| 15.02 || Regular languages (2): nondeterministic automata and regular expressions] || ||
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem, reductions (see also Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 23.03 || Finishing previous lecture, the classes RP, coRP and BPP, primes in BPP || ||
|-
|| 30.03(?) || Exam
|-
|| may || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:16:36Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1] ||
|-
|| 15.02 || Regular languages (2): equivalence between deterministic and nondeterministic automata, regular expressions] || ||
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem, reductions (see also Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 23.03 || Finishing previous lecture, the classes RP, coRP and BPP, primes in BPP || ||
|-
|| 30.03(?) || Exam
|-
|| may || Projects
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:16:13Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1] ||
|-
|| 15.02 || Regular languages (2): equivalence between deterministic and nondeterministic automata, regular expressions] || ||
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem, reductions (see also Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 23.03 || Finishing previous lecture, the classes RP, coRP and BPP, primes in BPP || ||
|-
|| 30.03(?) || Exam || ||
|-
|| may || Projects || ||
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:15:22Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1]
|-
|| 15.02 || Regular languages (2): equivalence between deterministic and nondeterministic automata, regular expressions] ||
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B]
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem, reductions (see also Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 23.03 || Finishing previous lecture, the classes RP, coRP and BPP, primes in BPP || ||
|-
|| 30.03(?) || Exam ||
|-
|| may || Projects ||
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:14:25Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework !
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1] ||
|-
|| 15.02 || Regular languages (2): equivalence between deterministic and nondeterministic automata, regular expressions] || ||
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] || ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem, reductions (see also Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
|-
|| 23.03 || Finishing previous lecture, the classes RP, coRP and BPP, primes in BPP ||
|-
|| 30.03(?) || Exam ||
|-
|| may || Projects ||
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:14:10Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework !!
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1] ||
|-
|| 15.02 || Regular languages (2): equivalence between deterministic and nondeterministic automata, regular expressions] || ||
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming || ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] || ||
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem, reductions (see also Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
|-
|| 23.03 || Finishing previous lecture, the classes RP, coRP and BPP, primes in BPP ||
|-
|| 30.03(?) || Exam ||
|-
|| may || Projects ||
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:13:31Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework !
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1]
|-
|| 15.02 || Regular languages (2): equivalence between deterministic and nondeterministic automata, regular expressions]
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B]
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar]
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem, reductions (see also Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
|-
|| 23.03 || Finishing previous lecture, the classes RP, coRP and BPP, primes in BPP ||
|-
|| 30.03(?) || Exam ||
|-
|| may || Projects ||
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:12:39Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1]
|-
|| 15.02 || Regular languages (2): equivalence between deterministic and nondeterministic automata, regular expressions]
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B]
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar]
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem, reductions (see also Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
|-
|| 23.03 || Finishing previous lecture, the classes RP, coRP and BPP, primes in BPP ||
|-
|| 30.03(?) || Exam ||
|-
|| may || Projects ||
|}

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || 14:00-18:00 || ||
|}
Warn me in advance by email.

Theoretical Computer Science 2022

2023-02-09T18:11:38Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information join the [https://t.me/+fjwhc1N_Cn1iNmEy telegram group]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !
|-
|| [https://youtu.be/BHm2eHFnC6U 19.01] || Regular languages: (non)deterministic automata and their equivalence, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1]
|-
|| 25.01 || Turing machines and register machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2]
|-
|| 09.02 || undecidability of: Halting program, Wang tiling, Fractran Godel's incompleteness theorems || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B]
|-
|| 16.02 || The classes P, EXP, PSPACE, EXPSPACE. Dynamic programming. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar]
|-
|| 23.02 || Holliday ||
|-
|| 02.03 || The class NP and NP-completeness || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes]
|-
|| 02.03 || Circuits, proof of the Levin-Cook theorem (see also Mertens&Moore chapter 5), more reductions || [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits]
|-
|| 16.03 || More NP-complete problems || [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
|-
|| 23.03 || Games, PSPACE, Savich theorem, completeness of TQBF || [https://www.dropbox.com/s/77sr5nhne411ahz/classPSPACE.pdf?dl=0 pspace]
|-
|| 30.03 || Parameterized complexity I: the class FPT and kernelization || [https://www.dropbox.com/s/khol9uoy24l6rmg/paramComp.pdf?dl=0 notes]
|-
|| 13.04 || Parameterized complexity II: the W-hierarchy || [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] (by Daniel Max) [https://www.dropbox.com/s/caigywrx80v08g3/exercises.pdf?dl=0 exercises]
|-
|| 20.04 || No lecture
|-
|| 27.04 || Projects ||
|}

= Homeworks =

[https://www.dropbox.com/s/uhi35jl4ofm1ws1/1_HW.pdf?dl=0 HW1 automata]

[https://www.dropbox.com/s/j4o5bqz0o1r171o/2_HW.pdf?dl=0 HW2 computability]

[https://www.dropbox.com/s/4mgniv56j9qg2c8/3_HW.pdf?dl=0 HW3 P, NP, hierarchy theorems, circuits]

[https://www.dropbox.com/s/w3d6hetx65se8hx/4_HW.pdf?dl=0 HW4 NP and PSPACE completeness]

[https://www.dropbox.com/s/q9afprj9wwgj7qy/5_HW.pdf?dl=0 HW5 parameterized complexity]

= Grading =

Homework: 50% 

Project: 50%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Parameterized algorithms'''

Marx and Misra, [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms Algorithms and Complexity], course website, 2020.

Fomin and 7 others. Parameterized algorithms, 2015. (This is an advanced book.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || || || 14:00-20:00
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:10:46Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1]
|-
|| 15.02 || Regular languages (2): equivalence between deterministic and nondeterministic automata, regular expressions]
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B]
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar]
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem, reductions (see also Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
|-
|| 23.03 || Finishing previous lecture, the classes RP, coRP and BPP, primes in BPP ||
|-
|| 30.03(?) || Exam ||
|-
|| may || Projects ||
|}

= Homeworks =

[https://www.dropbox.com/s/uhi35jl4ofm1ws1/1_HW.pdf?dl=0 HW1 automata]

[https://www.dropbox.com/s/j4o5bqz0o1r171o/2_HW.pdf?dl=0 HW2 computability]

[https://www.dropbox.com/s/4mgniv56j9qg2c8/3_HW.pdf?dl=0 HW3 P, NP, hierarchy theorems, circuits]

[https://www.dropbox.com/s/w3d6hetx65se8hx/4_HW.pdf?dl=0 HW4 NP and PSPACE completeness]

[https://www.dropbox.com/s/q9afprj9wwgj7qy/5_HW.pdf?dl=0 HW5 parameterized complexity]

= Grading =

Homework: 25%

Theory exam: 25%

Problem solving exam: 25%

Project: 25%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || || || 14:00-20:00
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:09:14Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1]
|-
|| 15.02 || Regular languages (2): equivalence between deterministic and nondeterministic automata, regular expressions]
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B]
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar]
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem, reductions (see also Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
|-
|| 23.03 || Finishing previous lecture, the classes RP, coRP and BPP, primes in BPP ||
|-
|| 30.03(?) || Exam ||
|-
|| may || Projects ||
|}

= Homeworks =

[https://www.dropbox.com/s/uhi35jl4ofm1ws1/1_HW.pdf?dl=0 HW1 automata]

[https://www.dropbox.com/s/j4o5bqz0o1r171o/2_HW.pdf?dl=0 HW2 computability]

[https://www.dropbox.com/s/4mgniv56j9qg2c8/3_HW.pdf?dl=0 HW3 P, NP, hierarchy theorems, circuits]

[https://www.dropbox.com/s/w3d6hetx65se8hx/4_HW.pdf?dl=0 HW4 NP and PSPACE completeness]

[https://www.dropbox.com/s/q9afprj9wwgj7qy/5_HW.pdf?dl=0 HW5 parameterized complexity]

= Grading =

Homework: 50% 

Project: 50%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || || || 14:00-20:00
|}
Warn me in advance by email.

Theoretical Computer Science 2022

2023-02-09T18:07:50Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information join the [https://t.me/+fjwhc1N_Cn1iNmEy telegram group]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !
|-
|| [https://youtu.be/BHm2eHFnC6U 19.01] || Regular languages: (non)deterministic automata and their equivalence, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1]
|-
|| 25.01 || Turing machines and register machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2]
|-
|| 09.02 || undecidability of: Halting program, Wang tiling, Fractran Godel's incompleteness theorems || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B]
|-
|| 16.02 || The classes P, EXP, PSPACE, EXPSPACE. Dynamic programming. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar]
|-
|| 23.02 || Holliday ||
|-
|| 02.03 || The class NP and NP-completeness || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes]
|-
|| 02.03 || Circuits, proof of the Levin-Cook theorem (see also Mertens&Moore chapter 5), more reductions || [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits]
|-
|| 16.03 || More NP-complete problems || [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
|-
|| 23.03 || Games, PSPACE, Savich theorem, completeness of TQBF || [https://www.dropbox.com/s/77sr5nhne411ahz/classPSPACE.pdf?dl=0 pspace]
|-
|| 30.03 || Parameterized complexity I: the class FPT and kernelization || [https://www.dropbox.com/s/khol9uoy24l6rmg/paramComp.pdf?dl=0 notes]
|-
|| 13.04 || Parameterized complexity II: the W-hierarchy || [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] (by Daniel Max) [https://www.dropbox.com/s/caigywrx80v08g3/exercises.pdf?dl=0 exercises]
|-
|| 20.04 || No lecture
|-
|| 27.04 || Projects ||
|}

= Grading =

Homework: 50% 

Project: 50%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Parameterized algorithms'''

Marx and Misra, [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms Algorithms and Complexity], course website, 2020.

Fomin and 7 others. Parameterized algorithms, 2015. (This is an advanced book.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || || || 14:00-20:00
|}
Warn me in advance by email.

Theoretical Computer Science 2022

2023-02-09T18:07:36Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information join the [https://t.me/+fjwhc1N_Cn1iNmEy telegram group]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !!
|-
|| [https://youtu.be/BHm2eHFnC6U 19.01] || Regular languages: (non)deterministic automata and their equivalence, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1]
|-
|| 25.01 || Turing machines and register machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2]
|-
|| 09.02 || undecidability of: Halting program, Wang tiling, Fractran Godel's incompleteness theorems || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B]
|-
|| 16.02 || The classes P, EXP, PSPACE, EXPSPACE. Dynamic programming. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar]
|-
|| 23.02 || Holliday ||
|-
|| 02.03 || The class NP and NP-completeness || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes]
|-
|| 02.03 || Circuits, proof of the Levin-Cook theorem (see also Mertens&Moore chapter 5), more reductions || [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits]
|-
|| 16.03 || More NP-complete problems || [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
|-
|| 23.03 || Games, PSPACE, Savich theorem, completeness of TQBF || [https://www.dropbox.com/s/77sr5nhne411ahz/classPSPACE.pdf?dl=0 pspace]
|-
|| 30.03 || Parameterized complexity I: the class FPT and kernelization || [https://www.dropbox.com/s/khol9uoy24l6rmg/paramComp.pdf?dl=0 notes]
|-
|| 13.04 || Parameterized complexity II: the W-hierarchy || [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] (by Daniel Max) [https://www.dropbox.com/s/caigywrx80v08g3/exercises.pdf?dl=0 exercises]
|-
|| 20.04 || No lecture
|-
|| 27.04 || Projects ||
|}

= Grading =

Homework: 50% 

Project: 50%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Parameterized algorithms'''

Marx and Misra, [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms Algorithms and Complexity], course website, 2020.

Fomin and 7 others. Parameterized algorithms, 2015. (This is an advanced book.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || || || 14:00-20:00
|}
Warn me in advance by email.

Theoretical Computer Science 2022

2023-02-09T18:06:53Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information join the [https://t.me/+fjwhc1N_Cn1iNmEy telegram group]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !!
|-
|| [https://youtu.be/BHm2eHFnC6U 19.01] || Regular languages: (non)deterministic automata and their equivalence, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1] ||
|-
|| 25.01 || Turing machines and register machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2]
|-
|| 09.02 || undecidability of: Halting program, Wang tiling, Fractran Godel's incompleteness theorems || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B]
|-
|| 16.02 || The classes P, EXP, PSPACE, EXPSPACE. Dynamic programming. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar]
|-
|| 23.02 || Holliday ||
|-
|| 02.03 || The class NP and NP-completeness || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] ||
|-
|| 02.03 || Circuits, proof of the Levin-Cook theorem (see also Mertens&Moore chapter 5), more reductions || [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits]
|-
|| 16.03 || More NP-complete problems || [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
|-
|| 23.03 || Games, PSPACE, Savich theorem, completeness of TQBF || [https://www.dropbox.com/s/77sr5nhne411ahz/classPSPACE.pdf?dl=0 pspace]
|-
|| 30.03 || Parameterized complexity I: the class FPT and kernelization || [https://www.dropbox.com/s/khol9uoy24l6rmg/paramComp.pdf?dl=0 notes]
|-
|| 13.04 || Parameterized complexity II: the W-hierarchy || [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] (by Daniel Max) [https://www.dropbox.com/s/caigywrx80v08g3/exercises.pdf?dl=0 exercises]
|-
|| 20.04 || No lecture
|-
|| 27.04 || Projects ||
|}

= Grading =

Homework: 50% 

Project: 50%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Parameterized algorithms'''

Marx and Misra, [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms Algorithms and Complexity], course website, 2020.

Fomin and 7 others. Parameterized algorithms, 2015. (This is an advanced book.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || || || 14:00-20:00
|}
Warn me in advance by email.

Theoretical Computer Science 2022

2023-02-09T18:04:43Z

Bbauwens:

= Classes =

Wednesdays 18:10–21:00, on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information join the [https://t.me/+fjwhc1N_Cn1iNmEy telegram group]

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes !! Homework
|-
|| [https://youtu.be/BHm2eHFnC6U 19.01] || Regular languages: (non)deterministic automata and their equivalence, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1] ||
|-
|| 25.01 || Turing machines and register machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2] ||
|-
|| 09.02 || undecidability of: Halting program, Wang tiling, Fractran Godel's incompleteness theorems || [https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] ||
|-
|| 16.02 || The classes P, EXP, PSPACE, EXPSPACE. Dynamic programming. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar] ||
|-
|| 23.02 || Holliday || ||
|-
|| 02.03 || The class NP and NP-completeness || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] || ||
|-
|| 02.03 || Circuits, proof of the Levin-Cook theorem (see also Mertens&Moore chapter 5), more reductions || [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits]
|-
|| 16.03 || More NP-complete problems || [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] ||
|-
|| 23.03 || Games, PSPACE, Savich theorem, completeness of TQBF || [https://www.dropbox.com/s/77sr5nhne411ahz/classPSPACE.pdf?dl=0 pspace]
|-
|| 30.03 || Parameterized complexity I: the class FPT and kernelization || [https://www.dropbox.com/s/khol9uoy24l6rmg/paramComp.pdf?dl=0 notes]
|-
|| 13.04 || Parameterized complexity II: the W-hierarchy || [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] (by Daniel Max) [https://www.dropbox.com/s/caigywrx80v08g3/exercises.pdf?dl=0 exercises]
|-
|| 20.04 || No lecture
|-
|| 27.04 || Projects ||
|}

= Grading =

Homework: 50% 

Project: 50%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Parameterized algorithms'''

Marx and Misra, [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms Algorithms and Complexity], course website, 2020.

Fomin and 7 others. Parameterized algorithms, 2015. (This is an advanced book.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || || || 14:00-20:00
|}
Warn me in advance by email.

Theoretical computer science spring 2023

2023-02-09T18:02:46Z

Bbauwens: Новая страница: «= Classes = Wednesdays 18:10–21:00, in room S834. Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] For practical information ask to joi…»

= Classes =

Wednesdays 18:10–21:00, in room S834.

Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]

For practical information ask to join the telegram group.

= Course Materials =


{| class="wikitable"
|-
! Video !! Summary !! Notes
|-
|| [https://youtu.be/BHm2eHFnC6U 08.02] || Regular languages 1: deterministic automata, pumping lemma, closure properties || [https://www.dropbox.com/s/uz1gyurwjvfwe77/automata.pdf?dl=0 lecture 1]
|-
|| 15.02 || Regular languages (2): equivalence between deterministic and nondeterministic automata, regular expressions]
|-
|| 22.02 || Turing machines, the Halting problem, Godel incompleteness theorems || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2][https://www.dropbox.com/s/nj7hw8udpbaha37/undecidable.pdf?dl=0 lecture 3.A] [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B]
|-
|| 02.03 || Famous polynomial time algorithms: Dijkstra, Kruskal, dynamic programming ||
|-
|| 09.03 || The classes P, EXP, PSPACE, EXPSPACE and NP. Time and space hierarchy theorems. || [https://www.dropbox.com/s/5amd18ey45qs4x3/cc_seminar.pdf?dl=0 seminar]
|-
|| 16.03 || NP-completeness, circuits, proof of the Levin-Cook theorem, reductions (see also Mertens&Moore chapter 5) || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] [https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits] [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
|-
|| 23.03 || Finishing previous lecture, the classes RP, coRP and BPP, primes in BPP ||
|-
|| 30.03(?) || Exam ||
|-
|| may || Projects ||
|}

= Homeworks =

[https://www.dropbox.com/s/uhi35jl4ofm1ws1/1_HW.pdf?dl=0 HW1 automata]

[https://www.dropbox.com/s/j4o5bqz0o1r171o/2_HW.pdf?dl=0 HW2 computability]

[https://www.dropbox.com/s/4mgniv56j9qg2c8/3_HW.pdf?dl=0 HW3 P, NP, hierarchy theorems, circuits]

[https://www.dropbox.com/s/w3d6hetx65se8hx/4_HW.pdf?dl=0 HW4 NP and PSPACE completeness]

[https://www.dropbox.com/s/q9afprj9wwgj7qy/5_HW.pdf?dl=0 HW5 parameterized complexity]

= Grading =

Homework: 50% 

Project: 50%

= References =

'''Computational complexity'''

Sipser, Introduction to the theory of computation", 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)

Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)

Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)

'''Parameterized algorithms'''

Marx and Misra, [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms Algorithms and Complexity], course website, 2020.

Fomin and 7 others. Parameterized algorithms, 2015. (This is an advanced book.)

'''Mathematical writing'''

Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.

Knuth, [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.

Gillman, Writing Mathematics Well, 1987.


= Office hours =

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday
|-
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || || || 14:00-20:00
|}
Warn me in advance by email.

Wiki ФКН

2023-02-09T17:46:45Z

Bbauwens: add PhD course Theoretical computer science spring 2023

__NOTOC__

= Учебные курсы факультета компьютерных наук =

== Курсы за 2022/23 учебный год ==

{| class="wikitable"
|-

! 1 курс !! 2 курс !! 3 курс !! 4 курс !! майноры и факультативы
|-
|
'''ПМИ'''

[[Линейная_алгебра_и_геометрия_на_ПМИ_2022/2023_(пилотный_поток) | Линейная алгебра и геометрия (пилотный поток)]]

[[Линейная_алгебра_и_геометрия_на_ПМИ_2022/2023_(основной_поток) | Линейная алгебра и геометрия (основной поток)]]

[[Математический_анализ_1_2022/2023_(основной_поток) | Математический анализ-1 (основной поток)]]

[[Математический_анализ_1_2022/2023_(пилотный_поток) | Математический анализ-1 (пилотный поток)]]

[[DM1base-2022-23 | Дискретная математика (ПМИ основной поток + ЭАД)]]

[[Дискретная_математика_(пилотный_поток) | Дискретная математика (пилотный поток)]]

[http://wiki.cs.hse.ru/Язык_программирования_Python_2022/2023_(основной_поток) Язык программирования Python 2022/2023 (основной_поток)]

[[Алгоритмы_и_структуры_данных_1_(основной_поток) | Алгоритмы и структуры данных 1 (основной поток)]]

[[Алгоритмы_и_структуры_данных_пилотный_поток_2022/2023 | Алгоритмы и структуры данных (пилотный поток)]]

[[Теория_чисел | Теория чисел (пилотный поток)]]

[[Теория_чисел_(основной_поток) | Теория чисел (основной поток)]]

'''ПИ'''

[[Дискретная математика 2022-2023 | Дискретная математика ]]

[[Алгебра ПИ 2022-2023 | Алгебра]]

'''ПАД'''

[[Calculus DSBA 2022/2023 | Calculus (DSBA)]]

[[English_DSBA_2022/2023 | English DSBA (DSBA)]]

[[LAaG DSBA 2022/2023 | LAaG (DSBA)]]

[[Discrete Mathematics DSBA 2022/2023 | Discrete Mathematics ]]

[[Introduction to Programming DSBA 2022/2023 | Introduction to Programming on Python (DSBA)]]

[[Introduction to Programming 2 DSBA 2022/2023 | Introduction to Programming on C++ (DSBA)]]

[[Foundations_of_Law_DSBA_2022/2023 | Foundations of Law (DSBA)]]

[[Introduction to Economics DSBA 2022/2023]]

'''КНАД'''

[[Дискретная_математика_КНАД 22/23| Дискретная математика (КНАД) ]]

[[Математический_анализ_КНАД 22/23| Математический анализ (КНАД) ]]

[[Линейная_алгебра_КНАД 22/23| Линейная алгебра (КНАД) ]]

[[Программирование_на_Python_КНАД 22/23| Программирование на Python (КНАД) ]]

[[Алгоритмы и структуры данных - 1 2022/2023 2 модуль (ЭАД КНАД ВСН) | Алгоритмы и структуры данных 2022/2023 2 модуль (ЭАД КНАД ВСН)]]

[[Python_для_сбора_и_анализа_данных_КНАД_22/23 | Python для сбора и анализа данных (КНАД)]]

[[Программирование_на_С++_КНАД_22/23 | Программирование на С++]]

||

'''ПМИ'''

[[Математическая_статистика_2022/2023_(пилотный_поток)| Математическая статистика (пилотный поток)]]

[[Математическая_статистика_2022/2023_(основной_поток)| Математическая статистика (основной поток)]]

[[Теория_вероятностей_2022/2023_(пилотный_поток)| Теория вероятностей (пилотный поток)]]

[[Теория_вероятностей_2022/2023_(основной_поток)| Теория вероятностей (основной поток)]]

[[Математический_Анализ_2_на_ПМИ_2022/2023_(пилотный_поток) | Математический анализ - 2 (пилотный поток)]]

[[Математический_анализ_-_2_(2022/23) | Математический анализ - 2 (основной поток)]]

[[Язык_программирования_C%2B%2B_(углубленный_курс)_2022 | Язык программирования C++ (углубленный курс)]]

[[Математическая_логика_ПМИ_22/23 | Математическая логика ]]

[[Продвинутый_Python_2022/2023 | Продвинутый Python ]]

[[Алгоритмы_и_структуры_данных_2_2022/2023 | Алгоритмы и структуры данных - 2 ]]

[[Язык_программирования_Rust | Язык программирования Rust ]]

[[Инструменты_промышленной_разработки_2022/2023 | Инструменты промышленной разработки 2022/2023 ]]

[[CAOS-2022 | Архитектура компьютеров и операционные системы]]

[[Дифференциальные уравнения (ПМИ)]]

[[Основы_матричных_вычислений_2022/2023 | Основы матричных вычислений ]]

'''ПИ'''

[[Алгоритмы_и_структуры_данных_на_ПИ_2022/2023 | Алгоритмы и структуры данных на ПИ]]

[[Теория вероятностей и математическая статистика 2022-2023 | Теория вероятностей и математическая статистика]]

[[НИС_Методы_и_алгоритмы_защиты_информации_2022/2023 | НИС Методы и алгоритмы защиты информации ]]

'''ПАД'''

[[Discrete Mathematics 2 DSBA 2022/2023 | Discrete Mathematics 2 (DSBA)]]

[[Business_and_Management_in_Global_Context_22/23 | Business and Management in Global Context 22/23]]

[[Calculus-2]]

[[Algorithms and Data Structures DSBA 2022/2023 | Algorithms and Data Structures]]

[[Probability and Statistics (DSBA)]]

[[Introduction to Micro and Macroeconomics DSBA 2022/2023]]

[[Differential_Equations_2021 | Differential Equations ]]

[[ACOS_DSBA_2022/2023 | Computer Architecture and Operating Systems]]

'''КНАД'''

[[Алгебра КНАД 2022/2023 | Алгебра]]

[[Математический_анализ -- 2 (2022/23) | Математический анализ -- 2]]

[[Алгоритмы_и_структуры_данных_2_КНАД 22/23 | Алгоритмы и структуры данных 2]]

[[Теория_вероятностей_КНАД 22/23 | Теория вероятностей ]]

[[ACOS_COMPDS_2022/2023 | Архитектура Компьютера и Операционные Системы]]

[[Математическая_статистика_КНАД_22/23 | Математическая статистика]]

[[Численные_методы_КНАД_22/23 | Численные методы]]

||

'''ПМИ'''

[[Машинное_обучение_1 | Машинное обучение 1]]

[[Компьютерные_сети_2022/2023 | Компьютерные сети 2022/2023]]

[[ Operation Research and Game Theory | Operation Research and Game Theory]]

[[ Statistical learning theory 2022 | Statistical Learning Theory]]

[[ Функциональное_программирование_22-23 | Функциональное программирование ]]

[[ Основы_тензорных_вычислений_(2022/2023) | Основы тензорных вычислений ]]

[[Глубинное обучение 1 22/23 | Введение в глубинное обучение 22/23]]

[[Математическое_моделирование_2022 | Математическое моделирование 2022]]

[[time_series_modelling_22_23 | Моделирование временных рядов 22/23]]

[[Теория_чисел_и_криптография | Теория чисел и криптография]]

[[Методы_оптимизации_22/23 | Методы оптимизации]]

'''ПМИ / МОП'''

[[Машинное_обучение_2 | Машинное обучение 2]]

[[Прикладная_статистика_в_машинном_обучении_22/23 | Прикладная статистика в машинном обучении 22/23]]

[[НИС_Машинное_обучение_и_приложения_3_курс_2022/2023 | НИС Машинное обучение и приложения 3 курс]]

[[Глубинное обучение 1 22/23 | Глубинное обучение 1 22/23]]

[[Методы оптимизации в машинном обучении 2023]]

'''ПМИ / РС'''

[https://osukhoroslov-hse.notion.site/a35a6a40088b44a7a9e374727a0f2548 Распределенные системы]

[https://osukhoroslov-hse.notion.site/dbce4f5101ed47dca0b363122f139aac НИС Распределенные системы]

[http://wiki.cs.hse.ru/Database_Systems_2023 Database Systems 2023]

'''ПМИ / ТИ'''

[[Theory of Computation 2022 | Theory of Computation]]

[[ NIS-TCS-22-23 | НИС Теоретическая информатика ]]

[[KKTI-22-23 | Комбинаторные конструкции в теоретической информатике]]

'''ПИ'''

[[ SPA_2022 |Принципы статического анализа исходного кода ]]

'''ПАД'''

[[tssp-2022-23 | Time series and stochastic processes 2022-23]]

[https://github.com/xenakas/dsba_ecm_2022 Elements of Econometrics]

[[BAFE-2022-23 | Business Analytics and Financial Engineering 2022-2023]]

[[Machine learning 1 DSBA 2022/2023]]

[[Databases]]

[[Optimisation methods]]

[[ MACE1_DSBA_22-23 | Research Seminar "Mathematical and Computational Engineering in Science and Business 1"]]

[[ DAF1_DSBA_22-23 | Research Seminar "Data Analysis in Finance 1"]]

||

'''ПМИ'''

[https://www.notion.so/2022-2023-12475421ada6400c8bd5bf24a2a30c01 ВКР]

[[ Случайные_процессы_(зима_2023) | Случайные процессы (зима 2023)]]

[[ Функциональное_программирование_22-23 | Функциональное программирование ]]

[[ Haskell_23 | Промышленное программирование на Haskell ]]

[[ Основы_тензорных_вычислений_(2022/2023) | Основы тензорных вычислений ]]

[[ Глубинное_обучение_в_обработке_звука_22/23 | Глубинное обучение в обработке звука ]]

[[ Методы_предобучения_без_учителя_22/23 | Методы предобучения без учителя ]]

[[ Символьные_вычисления_22/23 | Символьные вычисления ]]

[[Эффективные системы глубинного обучения 22/23|Эффективные системы глубинного обучения]]

[[Теория_и_практика_онлайн-экспериментов_22/23 | Теория и практика онлайн-экспериментов]]

[[Децентрализованные_системы | Децентрализованные системы ]]

'''ПМИ / МОП'''

[[НИС_Машинное_обучение_и_приложения_4_курс_2022/2023 | НИС Машинное обучение и приложения 4 курс]]

[[Глубинное_обучение_2022 | Глубинное обучение]]

[[Глубинное_обучение_в_анализе_графовых_данных_22/23 | Глубинное обучение в анализе графовых данных]]

[[LSML_2022/2023 | Машинное обучение для больших данных]]

'''ПМИ / РС'''

[https://osukhoroslov-hse.notion.site/2-b1c2d4487ac8478f89cd4fa427da3e27 НИС Распределенные системы]

'''ПМИ / ТИ'''

[[A_Theorist's_Toolkit_2022_2023 | A Theorist's Toolkit, AMI]]

[[OWF2022 | Односторонние функции и их применения]]

[[InfTheory2022 | Теория информации]]

[[ NIS-TCS-22-23 | НИС Теоретическая информатика ]]

'''ПИ'''

'''ПАД'''

[[ Statistics4MR-2022-23 | Statistics for Market Research 2022-23]]

[[ Strategy_22-23_DSBA | Decision Making Strategy 2022-2023]]

[[ APFM_22-23 | Asset Pricing and Financial Markets 2022-2023]]

[[ CMC_DSBA_22-23 | Core management concepts ]]

[[Machine learning 2 DSBA 2022/2023]]

[[ MACE2_DSBA_22-23 | Research Seminar "Mathematical and Computational Engineering in Science and Business 2"]]

[[ DAF2_DSBA_22-23 | Research Seminar "Data Analysis in Finance 2"]]

[[ DANS_DSBA_22-23 | Research Seminar "Data Analysis in the Natural Sciences" ]]

[[Risk-Management_DSBA_22-23 | Research Seminar "Risk-Management" ]]

[[Quantitative finance DSBA]]

||

[[Дополнительные_главы_теории_вероятностей_2023|ДГТВ]]

[[Теория_вычислений_2023|Теория вычислений]]

[[Случайные_графы_2022 | Случайные графы]]

[[Майнор_Биоинформатика_1_год_2022/23 | Биоинформатика 1 год 2022/23]]

[[Майнор Биоинформатика 2 год 2022/23 | Биоинформатика 2 год]]

[[Основы_машинного_обучения | Основы машинного обучения (майнор ИАД)]]

[[Основы_глубинного_обучения | Основы глубинного обучения (майнор ИАД)]]

[[Прикладные_задачи_анализа_данных | Прикладные задачи анализа данных (майнор ИАД)]]

[[Введение_в_программирование_22/23_(майнор_ИАД) | Введение в программирование 22/23 (майнор ИАД)]]

[[Базы данных 22/23 (майнор ИАД)| Базы данных 22/23 (майнор ИАД)]]

[[Adaptation course in Discrete Math (факультатив)]]

[[Уравнения с частными производными (2022-2023)|Уравнения с частными производными (2022-2023]]

|}

== Курсы в рамках проекта [https://www.hse.ru/dataculture/ Data Culture]==

=== 1 семестр ===
{| class="wikitable"
|-
! Дисциплина !! Образовательная программа !! Курс !! Модули

|-
| [[Цифровая грамотность для международных отношений 22/23 | Цифровая грамотность для международных отношений 22/23]] || Международных отношения || 1 курс || 1-2 модуль

|-
| [http://wiki.cs.hse.ru/%D0%9E%D1%81%D0%BD%D0%BE%D0%B2%D1%8B_%D0%B0%D0%BD%D0%B0%D0%BB%D0%B8%D0%B7%D0%B0_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%B2_%D0%BC%D0%B5%D0%B6%D0%B4%D1%83%D0%BD%D0%B0%D1%80%D0%BE%D0%B4%D0%BD%D1%8B%D1%85_%D0%BE%D1%82%D0%BD%D0%BE%D1%88%D0%B5%D0%BD%D0%B8%D1%8F%D1%85_22/23#.D0.9D.D0.B5.D0.BE.D0.B1.D1.85.D0.BE.D0.B4.D0.B8.D0.BC.D1.8B.D0.B5_.D1.81.D1.81.D1.8B.D0.BB.D0.BA.D0.B8 Основы анализа данных для международных отношений 22/23] || Международных отношения || 2 курс || 1-2 модуль

|-
| [http://wiki.cs.hse.ru/%D0%9E%D1%81%D0%BD%D0%BE%D0%B2%D1%8B_%D0%BF%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D1%8F_%D0%BD%D0%B0_Python_%D0%BE%D1%81%D0%B5%D0%BD%D1%8C_2022_%D0%BC%D0%B0%D1%82%D1%84%D0%B0%D0%BA#.D0.9F.D1.80.D0.B0.D0.B2.D0.B8.D0.BB.D0.B0_.D0.B4.D0.B5.D0.B4.D0.BB.D0.B0.D0.B9.D0.BD.D0.BE.D0.B2 Основы программирования на Python осень 2022 матфак] || Математика Совместная бакалавриат НИУ ВШЭ и ЦПМ Совместная магистратура НИУ ВШЭ и ЦПМ Математика и математическая физика|| 2-4 курс бакалавриата 1-2 курс магистратуры || 1-2 модуль

|-
| [[Анализ данных 2022 (ОП "Журналистика" и "Медиакоммуникации") | Анализ данных]] || Журналистика Медиакоммуникации || 2 курс || 1-2 модуль

|-
| [http://wiki.cs.hse.ru/%D0%9C%D0%B0%D1%88%D0%B8%D0%BD%D0%BD%D0%BE%D0%B5_%D0%BE%D0%B1%D1%83%D1%87%D0%B5%D0%BD%D0%B8%D0%B5_(%D0%A4%D0%AD%D0%9D)_-_2022-2023 Машинное обучение] || Экономика || 3,4 курс || 1-2 модули
|}

=== 2 семестр ===

{| class="wikitable"
|-
! Дисциплина !! Образовательная программа !! Курс !! Модули

|-
| [[Прикладное программное обеспечение (основы Python)| Прикладное программное обеспечение (основы Python)]] || Социология || 1 курс || 3 модуль

|-
| [[Основы программирования в Python | Основы программирования в Python]] || Политология || 2 курс || 3-4 модули

|-
| [[Основы программирования в Python для школы дизайна | Основы программирования в Python для школы дизайна]] || Дизайн, Мода, Современное искусство || 2 курс || 3-4 модули

|-
| [[Основы программирования в Python для ВШБ | Основы программирования в Python для ВШБ]] || Управление бизнесом Логистика и управлением цепями поставок Маркетинг и рыночная аналитика || 2 курс || 3 модуль

|-
| [[Программирование на Python для МО 22/23 | Программирование на Python для МО 22/23]] || Международные отношения || 1 курс || 3 модуль

|-
| [[Машинное_обучение_22/23_Матфак| Машинное_обучение_22/23_Матфак]] || Факультет математики || 3 курс || 3-4 модули
|-
| [[Анализ_Данных_22/23_Политологи| Анализ_Данных_22/23_Политологи]] || ФСН || 3 курс || 3-4 модули

|}

== Курсы магистратуры ФКН ==
{| class="wikitable"
|-
| [[Ликбез_разработчика_(2022) | Ликбез разработчика]] || Машинное обучение и высоконагруженные системы|| 1 year
|-
| [[RecSys_2022_2023 | Рекомендательные системы]] || ФТИАД || 2 year
|-
| [[Linear_Algebra_for_Data_Science_(2022) | Linear Algebra for Data Science]] || Data Science || 1 year
|-
| [[Ordered_Sets_in_Data_Analysis_(2022) | Ordered Sets in Data Analysis]] || Data Science || 1 year
|-
| [[ NIS-TCS-22-23 | НИС Теоретическая информатика ]] || Науки о данных, специализация ТИ ||
|-
| [[Mathematical Foundations of Probability theory | Mathematical foundations of probability theory]] || Math of Machine Learning || 1 year
|-
| [[Markov Chains | Markov Chains]] || Math of Machine Learning || 1 year
|-
| [[Reinforcement_learning_2022_2023 | Математические основы обучения с подкреплением ]] || Math of Machine Learning || 2 year
|-
| [[Theoretical computer science spring 2023 | Theoretical computer science spring 2023]] || PhD || 1 year
|}

== Курсы других факультетов ==

{| class="wikitable"
|-
! Дисциплина !! Курс !! Период
|-
| [[econ_probability_2022-23|Теория вероятностей и математическая статистика]] || фэн, 2 курс || 1-4 модуль
|-
| [[econ_metrics_2022-23|Эконометрика ип 2022-23]] || фэн, 3 курс || 1-4 модуль
|-
| [[econ_dynamic_opt_2022-23|Динамическая оптимизация в экономике и финансах]] || фэн, 3-4 курс || 1-2 модуль
|-
| [[icef-dse-2022-23|Data Science for Economics 2022-23]] ||icef, 3-4 year || 1-2 module
|-
| [[Лицей ВШЭ. Практикум по программированию 10 класс 2022-23 | Лицей ВШЭ. Практикум по программированию 10 класс]] || Лицей ВШЭ || 10 класс
|-
| [[icef-scalc-2022-fall|Stochastic Calculus Fall 2022]] ||icef, master 1 year || 2 module
|-
| [[econ_metrics_smfe_2022-23|Эконометрика (продвинутый уровень) 2022-23]] || фэн, магистратура, 1 курс || 3-4 модуль
|}

= Архив =

== Курсы за 2021/22 учебный год ==
{| class="wikitable"
|-

! 1 курс !! 2 курс !! 3 курс !! 4 курс !! майноры и факультативы
|-
|
'''ПМИ'''

[[Линейная_алгебра_и_геометрия_на_ПМИ_2021/2022_(пилотный_поток) | Линейная алгебра и геометрия (пилотный поток)]]

[[Линейная_алгебра_и_геометрия_на_ПМИ_2021/2022_(основной_поток) | Линейная алгебра и геометрия (основной поток)]]

[[Алгебра_на_ПМИ_2021/2022_(пилотный_поток) | Алгебра (пилотный поток)]]

[[Алгебра_на_ПМИ_2021/2022_(основной_поток) | Алгебра (основной поток)]]

[[Математический_Анализ_1_на_ПМИ_2021/2022_(пилотный_поток) | Математический анализ 1 (пилотный поток)]]

[[Математический_анализ_1_2021/2022_(основной_поток) | Математический анализ-1 (основной поток)]]

[[DM1-2021-22 | Дискретная математика]]

[http://wiki.cs.hse.ru/Основы_и_методология_программирования_на_ПМИ_2021/2022_(основной_поток) Основы и методология программирования 2021/2022 (основной поток)]

[[Алгоритмы и структуры данных пилотный поток 2021/2022 | Алгоритмы и структуры данных пилотный поток 2021/2022]]

[[Алгоритмы и структуры данных 1 основной поток 2021/2022 (4 модуль) | Алгоритмы и структуры данных 1 основной поток 2021/2022 (4 модуль)]]

'''ПИ'''

[[DM1-SE-2021-22 | Дискретная математика-1 ПИ]]

[http://hsealgebra22.wikidot.com/ Алгебра 2021/2022 ПИ wikidot]

[[Алгебра 2021/2022 ПИ | Алгебра 2021/2022 ПИ]]

'''ПАД'''

[[Algebra_DSBA_2021/2022 | Algebra DSBA]]

[[Discrete Mathematics DSBA 2021/2022 | Discrete Mathematics (DSBA)]]

[[LAaG DSBA 2021/2022 | LAaG (DSBA)]]

[[Calculus DSBA 2021/2022 | Calculus (DSBA)]]

[[Introduction to Programming DSBA 2021/2022 | Introduction to Programming (DSBA)]]

'''КНАД'''

[[Математический_анализ_(КНАД) | Математический анализ (КНАД)]]

[[Линейная алгебра_(КНАД) | Линейная алгебра (КНАД)]]

[[Программирование_на_Python | Программирование на Python (КНАД)]]

[[Дискретная_математика_КНАД | Дискретная математика (КНАД)]]

[[Алгоритмы и структуры данных-1 2021/2022 4 модуль (КНАД) | Алгоритмы и структуры данных (КНАД)]]

[[Программирование_на_С++_КНАД | Программирование на С++ (КНАД)]]

[[Python_для_сбора_и_анализа_данных_КНАД | Python для сбора и анализа данных (КНАД)]]

[[ИПР_КНАД_22 | Инструменты промышленной разработки (КНАД)]]

||

'''ПМИ'''

[[Теория_вероятностей_и_математическая_статистика_2021/2022_(пилотный_поток)| ТВиМС (пилотный поток)]]

[[Теория_вероятностей_2021/2022_(основной_поток)| ТВиМС (основной поток)]]

[[Математический анализ 2021/2022 (пилотный поток) | Математический анализ - 2 (пилотный поток)]]

[http://wiki.cs.hse.ru/%D0%9C%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%B8%D0%B9_%D0%B0%D0%BD%D0%B0%D0%BB%D0%B8%D0%B7_-_2.1_(2021/22) Математический анализ - 2.1 (основной поток)]

[[Математический_анализ_-_2.2_(2021/22) | Математический анализ - 2.2 (основной поток)]]

[[MissingSemester2021/2022 | Инструменты промышленной разработки (The Missing Semester of your CS education)]]

[[Язык программирования C++ (углубленный курс) | Язык программирования C++ (углубленный курс)]]

[[Математическая логика | Математическая логика]]

[[Дифференциальные уравнения (ПМИ, 2022)]]

[[Алгоритмы и структуры данных 2 2021 | Алгоритмы и структуры данных 2]]

[[Алгоритмы_и_структуры_данных_пилотный_поток_2020/2021 | Алгоритмы и структуры данных – 2 на ПМИ (пилотный поток)]]

[[CAOS-2021 | Архитектура компьютеров и операционные системы]]

[[Основы_матричных_вычислений_2021/2022| Основы матричных вычислений 2021/2022]]

'''ПИ'''

[[Алгоритмы и структуры данных на ПИ 2021/2022 | Алгоритмы и структуры данных на ПИ]]

[[НИС Методы и алгоритмы защиты информации | НИС Методы и алгоритмы защиты информации]]

'''ПАД'''

[[Discrete Mathematics 2 DSBA 2021/2022 | Discrete Mathematics 2 (DSBA)]]

[[Business_and_Management_in_Global_Context_2021/22 | Business and Management in Global Context (DSBA)]]

[[Statistics_DSBA_2021/2022 | Probability and Statistics (DSBA)]]

[[Differential_Equations_2023 | Differential Equations ]]

[[ACOS_DSBA_2021/2022 | Computer Architecture and Operating Systems (DSBA)]]

||

[https://www.notion.so/2021-2022-7374a6eeced2434288226a339bd5037f Курсовая работа]

'''ПМИ'''

[[Intro_to_DL_21/22 | Introduction to Deep Learning 21/22 ]]

[[Безопасность_компьютерных_систем_21/22 | Безопасность компьютерных систем 21/22]]

[http://wiki.cs.hse.ru/%D0%A7%D0%B8%D1%81%D0%BB%D0%B5%D0%BD%D0%BD%D1%8B%D0%B5_%D0%9C%D0%B5%D1%82%D0%BE%D0%B4%D1%8B_2022#.D0.A3.D1.87.D0.B5.D0.B1.D0.BD.D1.8B.D0.B9_.D0.BF.D0.BB.D0.B0.D0.BD Численные методы (2022)]

[[Методы_оптимизации_21/22 | Методы оптимизации 21/22]]

[http://wiki.cs.hse.ru/%D0%9C%D0%B0%D1%82%D0%B5%D0%BC%D0%B0%D1%82%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%BE%D0%B5_%D0%BC%D0%BE%D0%B4%D0%B5%D0%BB%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D0%B5_22 Математическое моделирование]

[http://wiki.cs.hse.ru/NIS-TCS-20-21 НИС Теоретическая информатика]

[[time_series_modelling_21_22 | Моделирование временных рядов 21/22]]

[[Анализ данных в бизнесе (Кафедра SAS) 21/22 | Анализ данных в бизнесе (Кафедра SAS) 21/22]]

[[Comb2021_2022 | Комбинаторные конструкции в теоретической информатике]]

[[Машинное_обучение_1/2021_2022 | Машинное обучение 1]]

[[Theory of Computation 2021 | Theory of Computation]]

[http://math-info.hse.ru/s21/8 Прикладные дифференциальные уравнения]

[[Сбор_и_разметка_данных_для_машинного_обучения_21/22 | Сбор и разметка данных для машинного обучения 21/22]]

[[Промышленное_программирование_на_языке_Java/2022 | Промышленное программирование на языке Java]]

'''ПМИ / PC'''

[https://osukhoroslov-hse.notion.site/5ca71a3b2b17452599f169468df43408 НИС Распределенные системы]

[[Database_Systems_2022 | Database Systems 2022]]

[https://osukhoroslov-hse.notion.site/082aef7073a844afa4c1bf718a773d77 Распределенные системы]

[https://naorlov.notion.site/naorlov/Nets-2021-51931594039e40aeb9102b784d7a8e70 Компьютерные сети]

'''ПМИ / МОП'''

[[Машинное_обучение_2/2021_2022 | Машинное обучение 2]]

[[Методы оптимизации в машинном обучении 2022| Методы оптимизации в машинном обучении 2022]]

[[НИС_Машинное_обучение_и_приложения_3_курс_2021/2022 | НИС Машинное обучение и приложения 3 курс]]

[http://wiki.cs.hse.ru/Psmo_21_22 Прикладная статистика в машинном обучении 21/22]

[[Statistical_learning_theory_2021 | Statistical learning theory]]

'''ПИ'''

[[ML4SE_1 | НИС Машинное обучение для программной инженерии]]

[[Технологии прикладного анализа данных SAS | Технологии прикладного анализа данных SAS]]

'''ПАД'''

[http://wiki.cs.hse.ru/Time_Series_and_Stochastic_Processes_ada_21_22 Time series and stochastic processes 2021-22]

[https://github.com/xenakas/dsba_ecm_2021 Elements of Econometrics ]

[[Data Science Case Studies (JD SAS) 21/22 | Data Science Case Studies (JD SAS) 21/22]]

[[SAS Technologies for Data Mining | SAS Technologies for Data Mining]]
[[Optimization_Methods_2022 | Optimization Methods]]

||

[[Введение_в_дифференциальную_геометрию_2022 | Введение в дифференциальную геометрию 2022]]

[[Символьные_вычисления_21/22 | Символьные вычисления 21/22]]

[[Случайные_процессы_(зима_2022) | Случайные процессы (зима 2022) ]]

[[Методы_сжатия_и_передачи_медиаданных_21/22 | Методы сжатия и передачи медиаданных 21/22]]

[[Теория_и_практика_онлайн-экспериментов_21/22 | Теория и практика онлайн-экспериментов 21/22]]

[[Безопасность_компьютерных_систем_21/22 | Безопасность компьютерных систем 21/22]]

[http://wiki.cs.hse.ru/%D0%94%D0%B8%D0%B7%D0%B0%D0%B9%D0%BD_%D1%81%D0%B8%D1%81%D1%82%D0%B5%D0%BC_21/22 Дизайн систем]

[http://wiki.cs.hse.ru/%D0%9E%D1%81%D0%BD%D0%BE%D0%B2%D1%8B_%D1%82%D0%B5%D0%BD%D0%B7%D0%BE%D1%80%D0%BD%D1%8B%D1%85_%D0%B2%D1%8B%D1%87%D0%B8%D1%81%D0%BB%D0%B5%D0%BD%D0%B8%D0%B9 Основы тензорых вычислений]

[[Сбор_и_разметка_данных_для_машинного_обучения_21/22 | Сбор и разметка данных для машинного обучения 21/22]]

[[Байесовские_методы_машинного_обучения_2021 | Байесовские методы машинного обучения]]

[[НИС_Машинное_обучение_и_приложения_4_курс_2021/2022 | НИС Машинное обучение и приложения 4 курс]]

[https://artemova.notion.site/artemova/c88a68750cff4b509699fa127be11801 Глубинное обучение для текстовых данных 2021/2022]

[http://wiki.cs.hse.ru/LSML_2021/2022 Машинное обучение для больших данных 21/22]

[[Эффективные системы глубинного обучения 21/22|Эффективные системы глубинного обучения]]

'''ПМИ / РС'''

[https://osukhoroslov-hse.notion.site/2-0cd36b67b9f64182bfeabcda9ede647a НИС Распределенные системы 2]

[[msbdp_21 | Методы и системы обработки больших данных]]

[https://osukhoroslov-hse.notion.site/cee4a50ac8cf4e328cefbd35cf822fa5 Облачные вычисления]

'''ПМИ / ТИ'''

[[InfTheory2021 | Теория информации]]

[[OWF2021 | Односторонние функции и их применения]]

[[ConvAppr22 | Выпуклое программирование и аппроксимационные алгоритмы ]]

'''ПАД'''

[[Statistics 4mr 2021-22 | Statistical Methods for Market Research (DSBA)]]

[[Decision Making Strategy]]

||

[[Дополнительные_главы_теории_вероятностей_2022|ДГТВ]]

[[Дополнительные_главы_теории_вероятностей-2_2021/2022|ДГТВ-2]]

[[Теория_вычислений_2022|Теория вычислений]]

[[NonClassicalLogics|Факультатив "Неклассические логики" (3 модуль)]]

[[Криптография_на_решётках_21/22| Криптография на решётках]]

[http://wiki.cs.hse.ru/%D0%9C%D0%B0%D0%B9%D0%BD%D0%BE%D1%80_%D0%91%D0%B8%D0%BE%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%82%D0%B8%D0%BA%D0%B0_1_%D0%B3%D0%BE%D0%B4_2021/22 Майнор Биоинформатика 1 год 2021/22]

[[Майнор_Биоинформатика_2_год_2021/22|Майнор Биоинформатика 2 год 2021/22]]

[[Введение_в_программирование_21/22_(майнор_ИАД) | Введение в программирование 21/22 (майнор ИАД)]]

[[Основы_машинного_обучения/2022 | Основы машинного обучения (майнор ИАД)]]

[[Основы_глубинного_обучения/2021_2022 | Основы глубинного обучения (майнор ИАД)]]

[[Прикладные_задачи_анализа_данных/2022 | Прикладные задачи анализа данных (майнор ИАД)]]

[[Функциональное_программирование_2019 | Функциональное программирование 2021]]

[[KotlinElective|Факультатив "Язык Kotlin" (ноя-дек 2021)]]

[[Dopglavy_DM_2022| Дополнительные главы дискретной математики]]

[[Факультатив_Data_Science_в_игровой_индустрии_(SAS) | Факультатив Data Science в игровой индустрии (SAS)]]

[[Факультатив_Анализ_данных_на_платформе_SAS | Факультатив Анализ данных на платформе SAS]]

[https://rroll.to/2D8yXl Основы и методология пикапа на ПМИ 2021/2022]

|}

== Курсы в рамках проекта [https://www.hse.ru/dataculture/ Data Culture]==

=== 2 семестр ===
{| class="wikitable"
|-
! Дисциплина !! Образовательная программа !! Курс !! Модули
|-
| [http://wiki.cs.hse.ru/%D0%9F%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D0%B5_%D0%BD%D0%B0_%D1%8F%D0%B7%D1%8B%D0%BA%D0%B5_Python,_%D0%B6%D1%83%D1%80%D0%BD%D0%B0%D0%BB%D0%B8%D1%81%D1%82%D0%B8%D0%BA%D0%B0_2022 Программирование на языке Python] || Журналистика || 2 курс || 4 модуль
|-
| [http://wiki.cs.hse.ru/Программирование_на_Python_деп_медиа_2022 Программирование на языке Python] || Журналистика и Медиакоммуникации || 1 курс || 3 модуль
|-
| [http://wiki.cs.hse.ru/Python_для_ОП_%22Психология%22_2021/2022 Программирование на языке Python] ||Психология || 1 курс || 3-4 модуль
|-
| [http://wiki.cs.hse.ru/Python_для_ОП_%22Экономика_и_статистика%22_и_ОП_%22География_глобальных_изменений%22_2021/2022 Программирование на языке Python] ||Экономика и статистика; География глобальных изменений || 2 курс || 3 модуль
|-
| [[Культура работы с данными]] ||Иностранные языки и межкультурная коммуникация || 1 курс || 3-4 модуль
|-
| [[Машинное обучение на матфаке 2022|Машинное обучение]] || Математика || 3-4 модули || 3-4 модули
|-
| [[Введение_в_МО_БИ_21/22| Введение в машинное обучение]] || Бизнес-информатика || 3 курс || 3-4 модули
|-
| [[Excel для анализа данных 21-22]] || Иностранные языки и межкультурная коммуникация || 4 курс || 3 модуль
|-
| [[Введение в Data Science 21-22]] || УБ и МиРА || 2 курс || 4 модуль
|-
| [[Основы программирования в Python (Мирэк) 2022 | Основы программирования в Python]] || Мировая экономика || 2 курс || 3-4 модуль
|-
|[http://wiki.cs.hse.ru/Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%A5%D0%B8%D0%BC%D0%B8%D1%8F Python для извлечения и обработки данных] || Химия || 2 курс || 4 модуль
|-
| [http://wiki.cs.hse.ru/Цифровая_грамотность_Городское_планирование_2021-2022 Цифровая грамотность] || Городское планирование || 1 курс || 4 модуль
|}

=== 1 семестр ===
{| class="wikitable"
|-
! Дисциплина !! Образовательная программа !! Курс !! Модули
|-
| [http://wiki.cs.hse.ru/%D0%A6%D0%B8%D1%84%D1%80%D0%BE%D0%B2%D0%B0%D1%8F_%D0%B3%D1%80%D0%B0%D0%BC%D0%BE%D1%82%D0%BD%D0%BE%D1%81%D1%82%D1%8C_%D0%93%D0%B5%D0%BE%D0%B3%D1%80%D0%B0%D1%84%D0%B8%D1%8F_2020/21 Цифровая грамотность] || География глобальных измерений и геоинформационные технологии || 1 курс || 1-2 модули
|-
| [[Цифровая грамотность, Востоковедение 2021/2022| Цифровая грамотность]] || Востоковедение || 1 курс || 1-2 модули
|-
|[[Цифровая Грамотность ИКВиА 2021/2022 | Цифровая грамотность]] || ИКВиА || 1 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/%D0%98%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%86%D0%B8%D0%BE%D0%BD%D0%BD%D1%8B%D0%B5_%D1%82%D0%B5%D1%85%D0%BD%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D0%B8_%D0%B2_%D0%B4%D0%B5%D1%8F%D1%82%D0%B5%D0%BB%D1%8C%D0%BD%D0%BE%D1%81%D1%82%D0%B8_%D1%8E%D1%80%D0%B8%D1%81%D1%82%D0%B0_2018-2019 Цифровая грамотность] || Юриспруденция || 1 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/%D0%98%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%86%D0%B8%D0%BE%D0%BD%D0%BD%D1%8B%D0%B5_%D1%82%D0%B5%D1%85%D0%BD%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D0%B8_%D0%B2_%D0%B4%D0%B5%D1%8F%D1%82%D0%B5%D0%BB%D1%8C%D0%BD%D0%BE%D1%81%D1%82%D0%B8_%D1%8E%D1%80%D0%B8%D1%81%D1%82%D0%B0_2018-2019 Цифровая грамотность] || Юриспруденция:частное право || 1 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/%D0%A6%D0%B8%D1%84%D1%80%D0%BE%D0%B2%D0%B0%D1%8F_%D0%B3%D1%80%D0%B0%D0%BC%D0%BE%D1%82%D0%BD%D0%BE%D1%81%D1%82%D1%8C_%D0%98%D1%81%D1%82%D0%BE%D1%80%D0%B8%D1%8F_2021/2022 Цифровая грамотность] ||История || 1 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/Цифровая_грамотность_Филология_2021/2022 Цифровая грамотность] || Филология || 1 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/%D0%A6%D0%B8%D1%84%D1%80%D0%BE%D0%B2%D0%B0%D1%8F_%D0%B3%D1%80%D0%B0%D0%BC%D0%BE%D1%82%D0%BD%D0%BE%D1%81%D1%82%D1%8C_2020-21_(%D0%9A%D1%83%D0%BB%D1%8C%D1%82%D1%83%D1%80%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F) Цифровая грамотность] || Культурология || 1 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/%D0%A6%D0%B8%D1%84%D1%80%D0%BE%D0%B2%D0%B0%D1%8F_%D0%B3%D1%80%D0%B0%D0%BC%D0%BE%D1%82%D0%BD%D0%BE%D1%81%D1%82%D1%8C_%D0%94%D0%B5%D0%BF%D0%B0%D1%80%D1%82%D0%B0%D0%BC%D0%B5%D0%BD%D1%82_%D0%9C%D0%B5%D0%B4%D0%B8%D0%B0_2021-2022 Цифровая грамотность] || Медиакоммуникации и Журналистика || 1 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/Цифровая_грамотность_Философия_2021/2022 Цифровая грамотность] || Философия || 1 курс || 1-2 модуль
|-
| [http://wiki.cs.hse.ru/Основы_программирования_на_Python_осень_2021_матфак Основы программирования на Python] || Математика || 3 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/%D0%90%D0%BD%D0%B0%D0%BB%D0%B8%D0%B7_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85_%D0%B2_R,_%D0%A1%D0%BE%D1%86%D0%B8%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F Анализ данных в R] || Социология || 4 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/%D0%9F%D0%9C%D0%A1%D0%90%D0%A0-2_2020 Методы анализа больших данных в исследованиях поведения покупателя] || Прикладные методы социального анализа рынков (магистратура) || 2 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/%D0%9C%D0%B0%D1%88%D0%B8%D0%BD%D0%BD%D0%BE%D0%B5_%D0%BE%D0%B1%D1%83%D1%87%D0%B5%D0%BD%D0%B8%D0%B5_(%D0%A4%D0%AD%D0%9D)_-_2021-2022 Машинное обучение] || Экономика || 3,4 курс || 1-2 модули
|-
| [[Программирование_ЭкСтат_ГП | Программирование на языке Python ]] || Городское планирование, Экономика и статистика || 3 курс || 1-2 модули
|-
| [[Основы анализа данных в международных отношениях 2021/2022 | Основы анализа данных в международных отношениях]] || Международные отношения || 2 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/Python_%D0%B4%D0%BB%D1%8F_%D0%B8%D0%B7%D0%B2%D0%BB%D0%B5%D1%87%D0%B5%D0%BD%D0%B8%D1%8F_%D0%B8_%D0%BE%D0%B1%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B8_%D0%B4%D0%B0%D0%BD%D0%BD%D1%8B%D1%85 Python извлечение и обработка данных] || Клеточная и молекулярная биотехнология || 1 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/%D0%9E%D1%81%D0%BD%D0%BE%D0%B2%D1%8B_%D0%BF%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D1%8F_%D0%B2_Python_(%D0%9F%D0%BE%D0%BB%D0%B8%D1%82%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D1%8F_2020) Основы программирования в Python ] || Политология || 3 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/Основы_работы_с_данными:_сбор,_анализ,_визуализация_(ОП_%22Журналистика%22) Основы работы с данными: сбор, анализ, визуализация] || Журналистика || 3 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/%D0%92%D0%B2%D0%B5%D0%B4%D0%B5%D0%BD%D0%B8%D0%B5_%D0%B2_Data_Science Data Science] || Экономика впечатлений: менеджмент в индустрии гостеприимства и туризме (магистратура) || 1 курс || 2 модуль
|-
| [http://wiki.cs.hse.ru/%D0%9C%D0%B0%D1%88%D0%B8%D0%BD%D0%BD%D0%BE%D0%B5_%D0%BE%D0%B1%D1%83%D1%87%D0%B5%D0%BD%D0%B8%D0%B5_(%D1%81%D0%BE%D0%B2._%D0%B1%D0%B0%D0%BA._%D0%92%D0%A8%D0%AD-%D0%A0%D0%AD%D0%A8_2021) Машинное обучение] || Совместный бакалавриат НИУ ВШЭ и РЭШ || 3 курс || 1-2 модули
|-
|
|| Бакалавриат НИУ ВШЭ и Лондонского университета || 3 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/Data_Analysis_in_Economics_and_Finance_2020-2021 Data Analysis in Economics and Finance] || Бакалавриат НИУ ВШЭ и Лондонского университета || 3 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/Data_Analysis_in_Journalism_and_Political_Science_2020-2021 Data Analysis in Journalism and Political Science]|| Бакалавриат НИУ ВШЭ и Лондонского университета || 3 курс || 1-2 модули
|-
| [http://wiki.cs.hse.ru/%D0%9F%D1%80%D0%B8%D0%BA%D0%BB%D0%B0%D0%B4%D0%BD%D1%8B%D0%B5_%D0%B8%D1%81%D1%81%D0%BB%D0%B5%D0%B4%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D1%8F_%D0%B2_%D0%BA%D1%83%D0%BB%D1%8C%D1%82%D1%83%D1%80%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D0%B8_2020_1%D0%BC%D0%BE%D0%B4%D1%83%D0%BB%D1%8C Прикладные исследования в культурологии] || Прикладная культурология (магистратура) || 1 курс || 1 модуль
|-
| [http://wiki.cs.hse.ru/%D0%9F%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D0%B5_%D0%B8_%D0%BA%D0%BE%D0%BC%D0%BF%D1%8C%D1%8E%D1%82%D0%B5%D1%80%D0%BD%D1%8B%D0%B5_%D0%B8%D0%BD%D1%81%D1%82%D1%80%D1%83%D0%BC%D0%B5%D0%BD%D1%82%D1%8B_%D0%BB%D0%B8%D0%BD%D0%B3%D0%B2%D0%B8%D1%81%D1%82%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%BE%D0%B3%D0%BE_%D0%B8%D1%81%D1%81%D0%BB%D0%B5%D0%B4%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D1%8F Программирование и лингвистические данные] || Фундаментальная и компьютерная лингвистика || 1 курс || 1, 2, 3, 4 модули
|-
| [http://wiki.cs.hse.ru/%D0%9F%D1%80%D0%BE%D0%B3%D1%80%D0%B0%D0%BC%D0%BC%D0%B8%D1%80%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D0%B5_%D0%B8_%D0%BA%D0%BE%D0%BC%D0%BF%D1%8C%D1%8E%D1%82%D0%B5%D1%80%D0%BD%D1%8B%D0%B5_%D0%B8%D0%BD%D1%81%D1%82%D1%80%D1%83%D0%BC%D0%B5%D0%BD%D1%82%D1%8B_%D0%BB%D0%B8%D0%BD%D0%B3%D0%B2%D0%B8%D1%81%D1%82%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%BE%D0%B3%D0%BE_%D0%B8%D1%81%D1%81%D0%BB%D0%B5%D0%B4%D0%BE%D0%B2%D0%B0%D0%BD%D0%B8%D1%8F Программирование и лингвистические данные] || Фундаментальная и компьютерная лингвистика || 1 курс || 1, 2, 3 модули
|-
| [http://wiki.cs.hse.ru/%D0%9A%D0%BE%D0%BC%D0%BF%D1%8C%D1%8E%D1%82%D0%B5%D1%80%D0%BD%D0%B0%D1%8F_%D0%BB%D0%B8%D0%BD%D0%B3%D0%B2%D0%B8%D1%81%D1%82%D0%B8%D0%BA%D0%B0_%D0%B8_%D0%B8%D0%BD%D1%84%D0%BE%D1%80%D0%BC%D0%B0%D1%86%D0%B8%D0%BE%D0%BD%D0%BD%D1%8B%D0%B5_%D1%82%D0%B5%D1%85%D0%BD%D0%BE%D0%BB%D0%BE%D0%B3%D0%B8%D0%B8 Программирование и теория алгоритмов] || Фундаментальная и компьютерная лингвистика || 3 курс || 2, 3, 4 модули
|-
| [https://github.com/daria-sa/NNmethods_ba_hse21-22/ Нейросетевые методы в обработке текстов] || Фундаментальная и компьютерная лингвистика || 4 курс || 1, 2, 3 модули
|-

|}

== Курсы магистратуры ФКН ==

{| class="wikitable"
|-
| [[Modern_Data_Analysis_2021_2022 | Modern Data Analysis]] || Data Science (Науки о данных) || 2 year
|-
| [[Project_Seminar_2021_2022 | Проектный семинар специализации ТИ]] || Науки о данных, специализация ТИ || 1 year
|-
| [[Theory of Computation 2021 | Theory of Computation]] || Науки о данных, специализация ТИ || 1 year
|-
| [[ConvAppr22 | Выпуклое программирование и аппроксимационные алгоритмы ]] || Науки о данных, специализация ТИ || 1 year
|-
| [[RecSys_2021_2022 | Рекомендательные системы]] || ФТИАД || 2 year
|-
| [[Stochastic_analysis_2021_2022 | Стохастический анализ 2021-2022]] || Math of Machine Learning || 1 year
|-
| [[Reinforcement_learning_2021_2022 | Математические основы обучения с подкреплением 2021-2022]] || Math of Machine Learning || 2 year
|-
| [[Theoretical_Computer_Science_2022 | Theoretical computer science 2021-2022]] || Theoretical computer science || PhD
|-
| [[Машинное_обучение_(современные_методы)-МОиВС-2021-2022 | Машинное обучение (современные методы)]] || Машинное обучение и высоконагруженные системы|| 1 year
|-
| [[Алгоритмы_и_структуры_данных-МОиВС-2021-2022 | Алгоритмы и структуры данных]] || Машинное обучение и высоконагруженные системы|| 1 year
|-
| [[Основы_промышленной_разработки-МОиВС-2021-2022 | Основы промышленной разработки]] || Машинное обучение и высоконагруженные системы|| 1 year
|-
| [[Глубинное обучение-МОиВС-2022-2023 | Глубинное обучение]] || Машинное обучение и высоконагруженные системы|| 1 year
|-
|}

== Курсы других факультетов ==

{| class="wikitable"
|-
! Дисциплина !! Курс !! Период
|-
| [http://wiki.cs.hse.ru/Econ_probability_2021-22 Теория вероятностей и математическая статистика] || фэн, 2 курс || 1-4 модуль
|-
| [[Динамическая оптимизация в экономике и финансах, фэн, 2021/22|Динамическая оптимизация в экономике и финансах]] || фэн, 3-4 курс || 1-2 модуль
|-
|}

= Архив до 2020/21 учебного года включительно =
[[Wiki ФКН/Архив]]

Theory of Computation 2022

2022-12-30T10:26:54Z

Bbauwens:

= Exam =

Date: Tuesday December 20th, 13h-16h, D501

The exam consists out of 8 exercises that you must solve in 3 hours time.

There will be copies of Sipser's book available (as well as Arora and Barak and Mertens and Moore). You may bring your own copy if you have it, as well as handwritten notes.

Feedback exam: Friday 30.12 at 14h on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

= Classes =

Lectures: Monday 13:00 - 14:20 in Pokrovkaya and on zoom by [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/191486005 Alexey Talambutsa]

Seminars: Monday 14:40 - 16:00 in Pokrovkaya and on zoom by [https://www.hse.ru/en/org/persons/208499388 Pavel Zakharov]

= Dates and Deadlines =

Homeworks 1, 2, 3: <s>September 26</s> '''October 3''' (update of 2.7 and 3.7 on 26/09)

Homeworks 4, 5: October 10

Homeworks 6, 7, 8: November 7

Homeworks 9, 10, 11: November 28

Submit homework in google classroom in this [https://classroom.google.com/c/NTQ5OTYyMzk3ODc0?cjc=27kcgjp link], code: 27kcgjp You should upload either scanned handwriting or pdf file into the corresponding section.

Table with [https://docs.google.com/spreadsheets/d/1J_mJJlr52xKDAGXF_4Rr-qdsW-q3p4XPzJVE-WDrxsk/edit?usp=sharing grades]


= Course Materials =

The main reference is Sipser's book "Introduction to the theory of computation", chapters 3, 4, 7–10.

For students abroad: the first 5 lectures are covered in chapters 3, 4, 7 and 9.1. Other lectures will be recorded. See also recordings of [http://wiki.cs.hse.ru/Theory_of_Computation_2021 previous year].

If you need some background in math, consider these two sources: 
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi 
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

{| class="wikitable"
|-
! !! Summary !! Problem list
|-
|| 05.09 || Turing machines, multitape Turing machines, connection between them. Universal Turing machine. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. || [https://www.dropbox.com/s/9n9ihiti0yufvc8/prob_1.pdf?dl=0 Problem set 1]
|-
|| 12.09 || Time and space hierarchy theorems. Time and space constructible functions. || [https://www.dropbox.com/s/jqz33aqwfl992tc/prob_2.pdf?dl=0 Problem set 2] update 26.09
|-
|| 19.09 || Because of various problems, the materials of last 2 weeks were repeated. || [https://www.dropbox.com/s/05iiwsdpggfjuul/prob_3.pdf?dl=0 Problem set 3] update 25.09
|-
|| 26.09 || Complexity class NP. Examples. Polynomial reductions. NP-hardness and NP-completeness. || [https://www.dropbox.com/s/454bok6rvsdtfix/prob_4.pdf?dl=0 Problem set 4]
|-
|| 3.10 || Non-deterministic TMs. Another definition of NP. Proving NP-hardness by reduction from an NP-complete problem. Examples of NP-complete problems. HAMPATH is NP-complete || [https://www.dropbox.com/s/y4ktp5e2tjryqwr/prob_5.pdf?dl=0 Problem set 5]
|-
|| 10.10 || Circuit complexity. Classes AC^i, NC^i, P/poly. All functions are computed by circuits. Existence of functions with exponential circuit complexity. NC1 = Boolean formulas of polynomial size. P is in P/poly. Addition in AC0. Multiplication is in NC1. [https://www.dropbox.com/s/0qnyl552qvplc0e/Acirctuis.pdf?dl=0 circuit_notes.pdf] || [https://www.dropbox.com/s/z54tjl4a5rswmhd/prob_6.pdf?dl=0 Problem set 6]
|-
|| 17.10 || Classes L, NL, PSPACE and NPSPACE. Inclusions between P, NP, and PSPACE. Cook–Levin theorem, NP-completeness of: subsetsum, set-splitting, 3-colorability and exactly 1-in-3 SAT. || [https://www.dropbox.com/s/y8rv53yz2he58uf/prob_7.pdf?dl=0 Problem set 7]
|-
|| 31.10 || Directed Reachability is in SPACE(log^2 n). TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) for space constructible s. PSPACE completeness of generalized geography. || [https://www.dropbox.com/s/d8svos0sn0d53ys/prob_08.pdf?dl=0 Problem set 8]
|-
||07.11 || Oracle computation definitions. There exists an oracle ''A'' for which P''A'' = NP''A''. There is an oracle B such that P''B'' is not equal to NP''B''. || [https://www.dropbox.com/s/qym967max8yxhsn/prob_9.pdf?dl=0 Problem set 9]update 23.11
|-
|| 14.11 || Probabilistic computation. Probabilistic machines, the class BPP, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Most of it is also [https://www.youtube.com/watch?v=YSMgVbOqB-8&list=PLm3J0oaFux3YL5vLXpzOyJiLtqLp6dCW2&index=23 here]|| [https://www.dropbox.com/s/zg1f51ryxliz2s9/prob_10.pdf?dl=0 Problem set 10]
|-
|| 21.11 || Streaming algorithms: finding the majority element, computation of the number of different elements  in logarithmic space. See Chapts 6.1-6.2 in [https://home.ttic.edu/~avrim/book.pdf foundations of datascience] by Avrim Blum and others. Another nice chapter in [http://theory.stanford.edu/~tim/w15/l/l1.pdf Tim Roughgarden's lecture notes] || [https://www.dropbox.com/s/r3zzgjyw07ltz2b/prob_11.pdf?dl=0 Problem set 11] update 21.11
|-
|| 28.11 || More streaming algorithms: calculation F_0 moments, Hash functions, finding the frequent items in streams of data: SpaceSaving. || [https://www.dropbox.com/s/he8ws0ldovhenhh/prob_12.pdf?dl=0 Problem set 12]
|-
|| 05.12 || Colloquium. ||
|-
|| 12.12 || Approximation algorithms and complexity of clustering [https://www.dropbox.com/s/wvtcsl6crkj8zeq/tc-12-approximation.pdf?dl=0 Slides.]
|| [https://www.dropbox.com/s/37gdsbv2it8omnm/tc-sample-exam.pdf?dl=0 Sample exam]
|}

For interested students: parameterized complexity. We review topics from chapters 1, 2, 3, 13 in "Parameterized algorithms" by Cygan, Fomin and others, 2016.

19 Sept: Fixed parameter tracktability and examples. Kernels. [https://www.dropbox.com/s/zzzaulpmzql7x7u/parameterizedComplexity.pdf?dl=0 presentation].

26 Sept: feedback vertex set, linear programming kernel for vertex cover, k-path problem, exercises on chapters 2 and 3.

3 Oct: Lower bounds using the exponential time hypothesis. [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] from a nice [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms course]

= Project (for PI students) =

During the 3rd module Januari till March 2023. The task is to understand a theoretical paper better by either

(Th) Rewrite some mathematical proof of a research paper in a more accessible way using your own words. You also need to give a lecture (you are not allowed to look at the paper during the lecture). I need to work out examples. Possibly examples that I give you on the spot.

(Imp) Implement an algorithm (or parts of an algorithm) from a research paper and demonstrate that it works.

Here are examples of each type concerning the vertex cover problem:

(Th) prove lemma 4.1 of the paper https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.127 , you need to study some parameterized complexity, see below the table with course materials for references.

(Th) prove theorem 5 from https://www.researchgate.net/profile/Lars-Jaffke/publication/329181540_What_is_known_about_Vertex_Cover_Kernelization/links/5cb319df92851c8d22ea17b6/What-is-known-about-Vertex-Cover-Kernelization.pdf

(Imp) implement a kernel and a simple branch and bound variant from https://arxiv.org/pdf/1908.06795.pdf, as well as compare your algorithm with the results in the contest https://pacechallenge.org/2019/vc/vc_exact/

You can propose projects yourself, but it is not allowed to have a theoretical paper about software verification. (Because there are too many definitions, and during the lecture it usually turns out the student does not understand them.)

= Additional reading =

Both books contain a lot of extra materials and describe more recent discoveries in computational complexity. The first book has a gentel and pleasant style. The second book is a rigurous textbook for students theoretical computer science at the beginning master level.

C. Moore and S. Mertens, The nature of computation, 2011.

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

= Grading =

For AMI students:

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] 

For PI students (the course is called "computational complexity" and takes 3 modules):

Final score = 0.25 * [score homework] + 0.25 * [score colloquium] + 0.25 * [score exam] + 0.25 * [score project] 

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra point on the final exam. There will be around 6 extra problems.

= Colloquium =

December 5, 13h00 -- 16h00, room D206 (room D102 after 14h40)

[https://www.dropbox.com/s/sk6df3zl4sxehwz/col.pdf?dl=0 rules and questions] (updated 25.11)

= Office hours =

Bruno Bauwens: Mondays 14h30-20h. Fridays 18h-20h.

Alexey Talambutsa: First contact by email.

Theory of Computation 2022

2022-12-30T10:25:39Z

Bbauwens:

= Exam =

Date: Tuesday December 20th, 13h-16h, D501

The exam consists out of 8 exercises that you must solve in 3 hours time.

There will be copies of Sipser's book available (as well as Arora and Barak and Mertens and Moore). You may bring your own copy if you have it, as well as handwritten notes.

Feedback exam: Friday 30.12 at 14h on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

= Classes =

Lectures: Monday 13:00 - 14:20 in Pokrovkaya and on this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] by [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/191486005 Alexey Talambutsa]

Seminars: Monday 14:40 - 16:00 in Pokrovkaya and on [https://us06web.zoom.us/j/82302406358?pwd=OFMyS2E4SVZaWFZaeXFsWHRFMWROZz09 zoomlink] by [https://www.hse.ru/en/org/persons/208499388 Pavel Zakharov]

= Dates and Deadlines =

Homeworks 1, 2, 3: <s>September 26</s> '''October 3''' (update of 2.7 and 3.7 on 26/09)

Homeworks 4, 5: October 10

Homeworks 6, 7, 8: November 7

Homeworks 9, 10, 11: November 28

Submit homework in google classroom in this [https://classroom.google.com/c/NTQ5OTYyMzk3ODc0?cjc=27kcgjp link], code: 27kcgjp You should upload either scanned handwriting or pdf file into the corresponding section.

Table with [https://docs.google.com/spreadsheets/d/1J_mJJlr52xKDAGXF_4Rr-qdsW-q3p4XPzJVE-WDrxsk/edit?usp=sharing grades]


= Course Materials =

The main reference is Sipser's book "Introduction to the theory of computation", chapters 3, 4, 7–10.

For students abroad: the first 5 lectures are covered in chapters 3, 4, 7 and 9.1. Other lectures will be recorded. See also recordings of [http://wiki.cs.hse.ru/Theory_of_Computation_2021 previous year].

If you need some background in math, consider these two sources: 
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi 
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

{| class="wikitable"
|-
! !! Summary !! Problem list
|-
|| 05.09 || Turing machines, multitape Turing machines, connection between them. Universal Turing machine. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. || [https://www.dropbox.com/s/9n9ihiti0yufvc8/prob_1.pdf?dl=0 Problem set 1]
|-
|| 12.09 || Time and space hierarchy theorems. Time and space constructible functions. || [https://www.dropbox.com/s/jqz33aqwfl992tc/prob_2.pdf?dl=0 Problem set 2] update 26.09
|-
|| 19.09 || Because of various problems, the materials of last 2 weeks were repeated. || [https://www.dropbox.com/s/05iiwsdpggfjuul/prob_3.pdf?dl=0 Problem set 3] update 25.09
|-
|| 26.09 || Complexity class NP. Examples. Polynomial reductions. NP-hardness and NP-completeness. || [https://www.dropbox.com/s/454bok6rvsdtfix/prob_4.pdf?dl=0 Problem set 4]
|-
|| 3.10 || Non-deterministic TMs. Another definition of NP. Proving NP-hardness by reduction from an NP-complete problem. Examples of NP-complete problems. HAMPATH is NP-complete || [https://www.dropbox.com/s/y4ktp5e2tjryqwr/prob_5.pdf?dl=0 Problem set 5]
|-
|| 10.10 || Circuit complexity. Classes AC^i, NC^i, P/poly. All functions are computed by circuits. Existence of functions with exponential circuit complexity. NC1 = Boolean formulas of polynomial size. P is in P/poly. Addition in AC0. Multiplication is in NC1. [https://www.dropbox.com/s/0qnyl552qvplc0e/Acirctuis.pdf?dl=0 circuit_notes.pdf] || [https://www.dropbox.com/s/z54tjl4a5rswmhd/prob_6.pdf?dl=0 Problem set 6]
|-
|| 17.10 || Classes L, NL, PSPACE and NPSPACE. Inclusions between P, NP, and PSPACE. Cook–Levin theorem, NP-completeness of: subsetsum, set-splitting, 3-colorability and exactly 1-in-3 SAT. || [https://www.dropbox.com/s/y8rv53yz2he58uf/prob_7.pdf?dl=0 Problem set 7]
|-
|| 31.10 || Directed Reachability is in SPACE(log^2 n). TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) for space constructible s. PSPACE completeness of generalized geography. || [https://www.dropbox.com/s/d8svos0sn0d53ys/prob_08.pdf?dl=0 Problem set 8]
|-
||07.11 || Oracle computation definitions. There exists an oracle ''A'' for which P''A'' = NP''A''. There is an oracle B such that P''B'' is not equal to NP''B''. || [https://www.dropbox.com/s/qym967max8yxhsn/prob_9.pdf?dl=0 Problem set 9]update 23.11
|-
|| 14.11 || Probabilistic computation. Probabilistic machines, the class BPP, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Most of it is also [https://www.youtube.com/watch?v=YSMgVbOqB-8&list=PLm3J0oaFux3YL5vLXpzOyJiLtqLp6dCW2&index=23 here]|| [https://www.dropbox.com/s/zg1f51ryxliz2s9/prob_10.pdf?dl=0 Problem set 10]
|-
|| 21.11 || Streaming algorithms: finding the majority element, computation of the number of different elements  in logarithmic space. See Chapts 6.1-6.2 in [https://home.ttic.edu/~avrim/book.pdf foundations of datascience] by Avrim Blum and others. Another nice chapter in [http://theory.stanford.edu/~tim/w15/l/l1.pdf Tim Roughgarden's lecture notes] || [https://www.dropbox.com/s/r3zzgjyw07ltz2b/prob_11.pdf?dl=0 Problem set 11] update 21.11
|-
|| 28.11 || More streaming algorithms: calculation F_0 moments, Hash functions, finding the frequent items in streams of data: SpaceSaving. || [https://www.dropbox.com/s/he8ws0ldovhenhh/prob_12.pdf?dl=0 Problem set 12]
|-
|| 05.12 || Colloquium. ||
|-
|| 12.12 || Approximation algorithms and complexity of clustering [https://www.dropbox.com/s/wvtcsl6crkj8zeq/tc-12-approximation.pdf?dl=0 Slides.]
|| [https://www.dropbox.com/s/37gdsbv2it8omnm/tc-sample-exam.pdf?dl=0 Sample exam]
|}

For interested students: parameterized complexity. We review topics from chapters 1, 2, 3, 13 in "Parameterized algorithms" by Cygan, Fomin and others, 2016.

19 Sept: Fixed parameter tracktability and examples. Kernels. [https://www.dropbox.com/s/zzzaulpmzql7x7u/parameterizedComplexity.pdf?dl=0 presentation].

26 Sept: feedback vertex set, linear programming kernel for vertex cover, k-path problem, exercises on chapters 2 and 3.

3 Oct: Lower bounds using the exponential time hypothesis. [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] from a nice [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms course]

= Project (for PI students) =

During the 3rd module Januari till March 2023. The task is to understand a theoretical paper better by either

(Th) Rewrite some mathematical proof of a research paper in a more accessible way using your own words. You also need to give a lecture (you are not allowed to look at the paper during the lecture). I need to work out examples. Possibly examples that I give you on the spot.

(Imp) Implement an algorithm (or parts of an algorithm) from a research paper and demonstrate that it works.

Here are examples of each type concerning the vertex cover problem:

(Th) prove lemma 4.1 of the paper https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.127 , you need to study some parameterized complexity, see below the table with course materials for references.

(Th) prove theorem 5 from https://www.researchgate.net/profile/Lars-Jaffke/publication/329181540_What_is_known_about_Vertex_Cover_Kernelization/links/5cb319df92851c8d22ea17b6/What-is-known-about-Vertex-Cover-Kernelization.pdf

(Imp) implement a kernel and a simple branch and bound variant from https://arxiv.org/pdf/1908.06795.pdf, as well as compare your algorithm with the results in the contest https://pacechallenge.org/2019/vc/vc_exact/

You can propose projects yourself, but it is not allowed to have a theoretical paper about software verification. (Because there are too many definitions, and during the lecture it usually turns out the student does not understand them.)

= Additional reading =

Both books contain a lot of extra materials and describe more recent discoveries in computational complexity. The first book has a gentel and pleasant style. The second book is a rigurous textbook for students theoretical computer science at the beginning master level.

C. Moore and S. Mertens, The nature of computation, 2011.

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

= Grading =

For AMI students:

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] 

For PI students (the course is called "computational complexity" and takes 3 modules):

Final score = 0.25 * [score homework] + 0.25 * [score colloquium] + 0.25 * [score exam] + 0.25 * [score project] 

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra point on the final exam. There will be around 6 extra problems.

= Colloquium =

December 5, 13h00 -- 16h00, room D206 (room D102 after 14h40)

[https://www.dropbox.com/s/sk6df3zl4sxehwz/col.pdf?dl=0 rules and questions] (updated 25.11)

= Office hours =

Bruno Bauwens: Mondays 14h30-20h. Fridays 18h-20h.

Alexey Talambutsa: First contact by email.

Theory of Computation 2022

2022-12-30T10:24:43Z

Bbauwens:

= Feedback exam =

Feedback exam: Friday 30.12 at 14h on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

= Exam =

Date: Tuesday December 20th, 13h-16h, D501

The exam consists out of 8 exercises that you must solve in 3 hours time.

There will be copies of Sipser's book available (as well as Arora and Barak and Mertens and Moore). You may bring your own copy if you have it, as well as handwritten notes.

= Classes =

Lectures: Monday 13:00 - 14:20 in Pokrovkaya and on this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] by [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/191486005 Alexey Talambutsa]

Seminars: Monday 14:40 - 16:00 in Pokrovkaya and on [https://us06web.zoom.us/j/82302406358?pwd=OFMyS2E4SVZaWFZaeXFsWHRFMWROZz09 zoomlink] by [https://www.hse.ru/en/org/persons/208499388 Pavel Zakharov]

= Dates and Deadlines =

Homeworks 1, 2, 3: <s>September 26</s> '''October 3''' (update of 2.7 and 3.7 on 26/09)

Homeworks 4, 5: October 10

Homeworks 6, 7, 8: November 7

Homeworks 9, 10, 11: November 28

Submit homework in google classroom in this [https://classroom.google.com/c/NTQ5OTYyMzk3ODc0?cjc=27kcgjp link], code: 27kcgjp You should upload either scanned handwriting or pdf file into the corresponding section.

Table with [https://docs.google.com/spreadsheets/d/1J_mJJlr52xKDAGXF_4Rr-qdsW-q3p4XPzJVE-WDrxsk/edit?usp=sharing grades]


= Course Materials =

The main reference is Sipser's book "Introduction to the theory of computation", chapters 3, 4, 7–10.

For students abroad: the first 5 lectures are covered in chapters 3, 4, 7 and 9.1. Other lectures will be recorded. See also recordings of [http://wiki.cs.hse.ru/Theory_of_Computation_2021 previous year].

If you need some background in math, consider these two sources: 
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi 
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

{| class="wikitable"
|-
! !! Summary !! Problem list
|-
|| 05.09 || Turing machines, multitape Turing machines, connection between them. Universal Turing machine. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. || [https://www.dropbox.com/s/9n9ihiti0yufvc8/prob_1.pdf?dl=0 Problem set 1]
|-
|| 12.09 || Time and space hierarchy theorems. Time and space constructible functions. || [https://www.dropbox.com/s/jqz33aqwfl992tc/prob_2.pdf?dl=0 Problem set 2] update 26.09
|-
|| 19.09 || Because of various problems, the materials of last 2 weeks were repeated. || [https://www.dropbox.com/s/05iiwsdpggfjuul/prob_3.pdf?dl=0 Problem set 3] update 25.09
|-
|| 26.09 || Complexity class NP. Examples. Polynomial reductions. NP-hardness and NP-completeness. || [https://www.dropbox.com/s/454bok6rvsdtfix/prob_4.pdf?dl=0 Problem set 4]
|-
|| 3.10 || Non-deterministic TMs. Another definition of NP. Proving NP-hardness by reduction from an NP-complete problem. Examples of NP-complete problems. HAMPATH is NP-complete || [https://www.dropbox.com/s/y4ktp5e2tjryqwr/prob_5.pdf?dl=0 Problem set 5]
|-
|| 10.10 || Circuit complexity. Classes AC^i, NC^i, P/poly. All functions are computed by circuits. Existence of functions with exponential circuit complexity. NC1 = Boolean formulas of polynomial size. P is in P/poly. Addition in AC0. Multiplication is in NC1. [https://www.dropbox.com/s/0qnyl552qvplc0e/Acirctuis.pdf?dl=0 circuit_notes.pdf] || [https://www.dropbox.com/s/z54tjl4a5rswmhd/prob_6.pdf?dl=0 Problem set 6]
|-
|| 17.10 || Classes L, NL, PSPACE and NPSPACE. Inclusions between P, NP, and PSPACE. Cook–Levin theorem, NP-completeness of: subsetsum, set-splitting, 3-colorability and exactly 1-in-3 SAT. || [https://www.dropbox.com/s/y8rv53yz2he58uf/prob_7.pdf?dl=0 Problem set 7]
|-
|| 31.10 || Directed Reachability is in SPACE(log^2 n). TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) for space constructible s. PSPACE completeness of generalized geography. || [https://www.dropbox.com/s/d8svos0sn0d53ys/prob_08.pdf?dl=0 Problem set 8]
|-
||07.11 || Oracle computation definitions. There exists an oracle ''A'' for which P''A'' = NP''A''. There is an oracle B such that P''B'' is not equal to NP''B''. || [https://www.dropbox.com/s/qym967max8yxhsn/prob_9.pdf?dl=0 Problem set 9]update 23.11
|-
|| 14.11 || Probabilistic computation. Probabilistic machines, the class BPP, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Most of it is also [https://www.youtube.com/watch?v=YSMgVbOqB-8&list=PLm3J0oaFux3YL5vLXpzOyJiLtqLp6dCW2&index=23 here]|| [https://www.dropbox.com/s/zg1f51ryxliz2s9/prob_10.pdf?dl=0 Problem set 10]
|-
|| 21.11 || Streaming algorithms: finding the majority element, computation of the number of different elements  in logarithmic space. See Chapts 6.1-6.2 in [https://home.ttic.edu/~avrim/book.pdf foundations of datascience] by Avrim Blum and others. Another nice chapter in [http://theory.stanford.edu/~tim/w15/l/l1.pdf Tim Roughgarden's lecture notes] || [https://www.dropbox.com/s/r3zzgjyw07ltz2b/prob_11.pdf?dl=0 Problem set 11] update 21.11
|-
|| 28.11 || More streaming algorithms: calculation F_0 moments, Hash functions, finding the frequent items in streams of data: SpaceSaving. || [https://www.dropbox.com/s/he8ws0ldovhenhh/prob_12.pdf?dl=0 Problem set 12]
|-
|| 05.12 || Colloquium. ||
|-
|| 12.12 || Approximation algorithms and complexity of clustering [https://www.dropbox.com/s/wvtcsl6crkj8zeq/tc-12-approximation.pdf?dl=0 Slides.]
|| [https://www.dropbox.com/s/37gdsbv2it8omnm/tc-sample-exam.pdf?dl=0 Sample exam]
|}

For interested students: parameterized complexity. We review topics from chapters 1, 2, 3, 13 in "Parameterized algorithms" by Cygan, Fomin and others, 2016.

19 Sept: Fixed parameter tracktability and examples. Kernels. [https://www.dropbox.com/s/zzzaulpmzql7x7u/parameterizedComplexity.pdf?dl=0 presentation].

26 Sept: feedback vertex set, linear programming kernel for vertex cover, k-path problem, exercises on chapters 2 and 3.

3 Oct: Lower bounds using the exponential time hypothesis. [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] from a nice [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms course]

= Project (for PI students) =

During the 3rd module Januari till March 2023. The task is to understand a theoretical paper better by either

(Th) Rewrite some mathematical proof of a research paper in a more accessible way using your own words. You also need to give a lecture (you are not allowed to look at the paper during the lecture). I need to work out examples. Possibly examples that I give you on the spot.

(Imp) Implement an algorithm (or parts of an algorithm) from a research paper and demonstrate that it works.

Here are examples of each type concerning the vertex cover problem:

(Th) prove lemma 4.1 of the paper https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.127 , you need to study some parameterized complexity, see below the table with course materials for references.

(Th) prove theorem 5 from https://www.researchgate.net/profile/Lars-Jaffke/publication/329181540_What_is_known_about_Vertex_Cover_Kernelization/links/5cb319df92851c8d22ea17b6/What-is-known-about-Vertex-Cover-Kernelization.pdf

(Imp) implement a kernel and a simple branch and bound variant from https://arxiv.org/pdf/1908.06795.pdf, as well as compare your algorithm with the results in the contest https://pacechallenge.org/2019/vc/vc_exact/

You can propose projects yourself, but it is not allowed to have a theoretical paper about software verification. (Because there are too many definitions, and during the lecture it usually turns out the student does not understand them.)

= Additional reading =

Both books contain a lot of extra materials and describe more recent discoveries in computational complexity. The first book has a gentel and pleasant style. The second book is a rigurous textbook for students theoretical computer science at the beginning master level.

C. Moore and S. Mertens, The nature of computation, 2011.

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

= Grading =

For AMI students:

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] 

For PI students (the course is called "computational complexity" and takes 3 modules):

Final score = 0.25 * [score homework] + 0.25 * [score colloquium] + 0.25 * [score exam] + 0.25 * [score project] 

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra point on the final exam. There will be around 6 extra problems.

= Colloquium =

December 5, 13h00 -- 16h00, room D206 (room D102 after 14h40)

[https://www.dropbox.com/s/sk6df3zl4sxehwz/col.pdf?dl=0 rules and questions] (updated 25.11)

= Office hours =

Bruno Bauwens: Mondays 14h30-20h. Fridays 18h-20h. You can warn in advance by emailing to brbauwens -a- gmail.com

Alexey Talambutsa: First contact by email.

Theory of Computation 2022

2022-12-28T17:03:05Z

Bbauwens:

= Feedback exam =

Feedback exam: Friday 30.12 at 14h on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

You should send an email to alexey.talambutsa -at- gmail.com before Thursday 23h59 (so that we know that at least 1 student will come).

= Exam =

Date: Tuesday December 20th, 13h-16h, D501

The exam consists out of 8 exercises that you must solve in 3 hours time.

There will be copies of Sipser's book available (as well as Arora and Barak and Mertens and Moore). You may bring your own copy if you have it, as well as handwritten notes.

= Classes =

Lectures: Monday 13:00 - 14:20 in Pokrovkaya and on this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] by [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/191486005 Alexey Talambutsa]

Seminars: Monday 14:40 - 16:00 in Pokrovkaya and on [https://us06web.zoom.us/j/82302406358?pwd=OFMyS2E4SVZaWFZaeXFsWHRFMWROZz09 zoomlink] by [https://www.hse.ru/en/org/persons/208499388 Pavel Zakharov]

= Dates and Deadlines =

Homeworks 1, 2, 3: <s>September 26</s> '''October 3''' (update of 2.7 and 3.7 on 26/09)

Homeworks 4, 5: October 10

Homeworks 6, 7, 8: November 7

Homeworks 9, 10, 11: November 28

Submit homework in google classroom in this [https://classroom.google.com/c/NTQ5OTYyMzk3ODc0?cjc=27kcgjp link], code: 27kcgjp You should upload either scanned handwriting or pdf file into the corresponding section.

Table with [https://docs.google.com/spreadsheets/d/1J_mJJlr52xKDAGXF_4Rr-qdsW-q3p4XPzJVE-WDrxsk/edit?usp=sharing grades]


= Course Materials =

The main reference is Sipser's book "Introduction to the theory of computation", chapters 3, 4, 7–10.

For students abroad: the first 5 lectures are covered in chapters 3, 4, 7 and 9.1. Other lectures will be recorded. See also recordings of [http://wiki.cs.hse.ru/Theory_of_Computation_2021 previous year].

If you need some background in math, consider these two sources: 
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi 
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

{| class="wikitable"
|-
! !! Summary !! Problem list
|-
|| 05.09 || Turing machines, multitape Turing machines, connection between them. Universal Turing machine. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. || [https://www.dropbox.com/s/9n9ihiti0yufvc8/prob_1.pdf?dl=0 Problem set 1]
|-
|| 12.09 || Time and space hierarchy theorems. Time and space constructible functions. || [https://www.dropbox.com/s/jqz33aqwfl992tc/prob_2.pdf?dl=0 Problem set 2] update 26.09
|-
|| 19.09 || Because of various problems, the materials of last 2 weeks were repeated. || [https://www.dropbox.com/s/05iiwsdpggfjuul/prob_3.pdf?dl=0 Problem set 3] update 25.09
|-
|| 26.09 || Complexity class NP. Examples. Polynomial reductions. NP-hardness and NP-completeness. || [https://www.dropbox.com/s/454bok6rvsdtfix/prob_4.pdf?dl=0 Problem set 4]
|-
|| 3.10 || Non-deterministic TMs. Another definition of NP. Proving NP-hardness by reduction from an NP-complete problem. Examples of NP-complete problems. HAMPATH is NP-complete || [https://www.dropbox.com/s/y4ktp5e2tjryqwr/prob_5.pdf?dl=0 Problem set 5]
|-
|| 10.10 || Circuit complexity. Classes AC^i, NC^i, P/poly. All functions are computed by circuits. Existence of functions with exponential circuit complexity. NC1 = Boolean formulas of polynomial size. P is in P/poly. Addition in AC0. Multiplication is in NC1. [https://www.dropbox.com/s/0qnyl552qvplc0e/Acirctuis.pdf?dl=0 circuit_notes.pdf] || [https://www.dropbox.com/s/z54tjl4a5rswmhd/prob_6.pdf?dl=0 Problem set 6]
|-
|| 17.10 || Classes L, NL, PSPACE and NPSPACE. Inclusions between P, NP, and PSPACE. Cook–Levin theorem, NP-completeness of: subsetsum, set-splitting, 3-colorability and exactly 1-in-3 SAT. || [https://www.dropbox.com/s/y8rv53yz2he58uf/prob_7.pdf?dl=0 Problem set 7]
|-
|| 31.10 || Directed Reachability is in SPACE(log^2 n). TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) for space constructible s. PSPACE completeness of generalized geography. || [https://www.dropbox.com/s/d8svos0sn0d53ys/prob_08.pdf?dl=0 Problem set 8]
|-
||07.11 || Oracle computation definitions. There exists an oracle ''A'' for which P''A'' = NP''A''. There is an oracle B such that P''B'' is not equal to NP''B''. || [https://www.dropbox.com/s/qym967max8yxhsn/prob_9.pdf?dl=0 Problem set 9]update 23.11
|-
|| 14.11 || Probabilistic computation. Probabilistic machines, the class BPP, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Most of it is also [https://www.youtube.com/watch?v=YSMgVbOqB-8&list=PLm3J0oaFux3YL5vLXpzOyJiLtqLp6dCW2&index=23 here]|| [https://www.dropbox.com/s/zg1f51ryxliz2s9/prob_10.pdf?dl=0 Problem set 10]
|-
|| 21.11 || Streaming algorithms: finding the majority element, computation of the number of different elements  in logarithmic space. See Chapts 6.1-6.2 in [https://home.ttic.edu/~avrim/book.pdf foundations of datascience] by Avrim Blum and others. Another nice chapter in [http://theory.stanford.edu/~tim/w15/l/l1.pdf Tim Roughgarden's lecture notes] || [https://www.dropbox.com/s/r3zzgjyw07ltz2b/prob_11.pdf?dl=0 Problem set 11] update 21.11
|-
|| 28.11 || More streaming algorithms: calculation F_0 moments, Hash functions, finding the frequent items in streams of data: SpaceSaving. || [https://www.dropbox.com/s/he8ws0ldovhenhh/prob_12.pdf?dl=0 Problem set 12]
|-
|| 05.12 || Colloquium. ||
|-
|| 12.12 || Approximation algorithms and complexity of clustering [https://www.dropbox.com/s/wvtcsl6crkj8zeq/tc-12-approximation.pdf?dl=0 Slides.]
|| [https://www.dropbox.com/s/37gdsbv2it8omnm/tc-sample-exam.pdf?dl=0 Sample exam]
|}

For interested students: parameterized complexity. We review topics from chapters 1, 2, 3, 13 in "Parameterized algorithms" by Cygan, Fomin and others, 2016.

19 Sept: Fixed parameter tracktability and examples. Kernels. [https://www.dropbox.com/s/zzzaulpmzql7x7u/parameterizedComplexity.pdf?dl=0 presentation].

26 Sept: feedback vertex set, linear programming kernel for vertex cover, k-path problem, exercises on chapters 2 and 3.

3 Oct: Lower bounds using the exponential time hypothesis. [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] from a nice [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms course]

= Project (for PI students) =

During the 3rd module Januari till March 2023. The task is to understand a theoretical paper better by either

(Th) Rewrite some mathematical proof of a research paper in a more accessible way using your own words. You also need to give a lecture (you are not allowed to look at the paper during the lecture). I need to work out examples. Possibly examples that I give you on the spot.

(Imp) Implement an algorithm (or parts of an algorithm) from a research paper and demonstrate that it works.

Here are examples of each type concerning the vertex cover problem:

(Th) prove lemma 4.1 of the paper https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.127 , you need to study some parameterized complexity, see below the table with course materials for references.

(Th) prove theorem 5 from https://www.researchgate.net/profile/Lars-Jaffke/publication/329181540_What_is_known_about_Vertex_Cover_Kernelization/links/5cb319df92851c8d22ea17b6/What-is-known-about-Vertex-Cover-Kernelization.pdf

(Imp) implement a kernel and a simple branch and bound variant from https://arxiv.org/pdf/1908.06795.pdf, as well as compare your algorithm with the results in the contest https://pacechallenge.org/2019/vc/vc_exact/

You can propose projects yourself, but it is not allowed to have a theoretical paper about software verification. (Because there are too many definitions, and during the lecture it usually turns out the student does not understand them.)

= Additional reading =

Both books contain a lot of extra materials and describe more recent discoveries in computational complexity. The first book has a gentel and pleasant style. The second book is a rigurous textbook for students theoretical computer science at the beginning master level.

C. Moore and S. Mertens, The nature of computation, 2011.

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

= Grading =

For AMI students:

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] 

For PI students (the course is called "computational complexity" and takes 3 modules):

Final score = 0.25 * [score homework] + 0.25 * [score colloquium] + 0.25 * [score exam] + 0.25 * [score project] 

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra point on the final exam. There will be around 6 extra problems.

= Colloquium =

December 5, 13h00 -- 16h00, room D206 (room D102 after 14h40)

[https://www.dropbox.com/s/sk6df3zl4sxehwz/col.pdf?dl=0 rules and questions] (updated 25.11)

= Office hours =

Bruno Bauwens: Mondays 14h30-20h. Fridays 18h-20h. You can warn in advance by emailing to brbauwens -a- gmail.com

Alexey Talambutsa: First contact by email.

Theory of Computation 2022

2022-12-28T17:01:57Z

Bbauwens:

= Feedback exam =

Feedback exam: Friday 30.12 at 14h on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

You should send an email before Thursday 23h59 (so that we know that at least 1 student will come).

= Exam =

Date: Tuesday December 20th, 13h-16h, D501

The exam consists out of 8 exercises that you must solve in 3 hours time.

There will be copies of Sipser's book available (as well as Arora and Barak and Mertens and Moore). You may bring your own copy if you have it, as well as handwritten notes.

= Classes =

Lectures: Monday 13:00 - 14:20 in Pokrovkaya and on this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] by [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/191486005 Alexey Talambutsa]

Seminars: Monday 14:40 - 16:00 in Pokrovkaya and on [https://us06web.zoom.us/j/82302406358?pwd=OFMyS2E4SVZaWFZaeXFsWHRFMWROZz09 zoomlink] by [https://www.hse.ru/en/org/persons/208499388 Pavel Zakharov]

= Dates and Deadlines =

Homeworks 1, 2, 3: <s>September 26</s> '''October 3''' (update of 2.7 and 3.7 on 26/09)

Homeworks 4, 5: October 10

Homeworks 6, 7, 8: November 7

Homeworks 9, 10, 11: November 28

Submit homework in google classroom in this [https://classroom.google.com/c/NTQ5OTYyMzk3ODc0?cjc=27kcgjp link], code: 27kcgjp You should upload either scanned handwriting or pdf file into the corresponding section.

Table with [https://docs.google.com/spreadsheets/d/1J_mJJlr52xKDAGXF_4Rr-qdsW-q3p4XPzJVE-WDrxsk/edit?usp=sharing grades]


= Course Materials =

The main reference is Sipser's book "Introduction to the theory of computation", chapters 3, 4, 7–10.

For students abroad: the first 5 lectures are covered in chapters 3, 4, 7 and 9.1. Other lectures will be recorded. See also recordings of [http://wiki.cs.hse.ru/Theory_of_Computation_2021 previous year].

If you need some background in math, consider these two sources: 
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi 
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

{| class="wikitable"
|-
! !! Summary !! Problem list
|-
|| 05.09 || Turing machines, multitape Turing machines, connection between them. Universal Turing machine. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. || [https://www.dropbox.com/s/9n9ihiti0yufvc8/prob_1.pdf?dl=0 Problem set 1]
|-
|| 12.09 || Time and space hierarchy theorems. Time and space constructible functions. || [https://www.dropbox.com/s/jqz33aqwfl992tc/prob_2.pdf?dl=0 Problem set 2] update 26.09
|-
|| 19.09 || Because of various problems, the materials of last 2 weeks were repeated. || [https://www.dropbox.com/s/05iiwsdpggfjuul/prob_3.pdf?dl=0 Problem set 3] update 25.09
|-
|| 26.09 || Complexity class NP. Examples. Polynomial reductions. NP-hardness and NP-completeness. || [https://www.dropbox.com/s/454bok6rvsdtfix/prob_4.pdf?dl=0 Problem set 4]
|-
|| 3.10 || Non-deterministic TMs. Another definition of NP. Proving NP-hardness by reduction from an NP-complete problem. Examples of NP-complete problems. HAMPATH is NP-complete || [https://www.dropbox.com/s/y4ktp5e2tjryqwr/prob_5.pdf?dl=0 Problem set 5]
|-
|| 10.10 || Circuit complexity. Classes AC^i, NC^i, P/poly. All functions are computed by circuits. Existence of functions with exponential circuit complexity. NC1 = Boolean formulas of polynomial size. P is in P/poly. Addition in AC0. Multiplication is in NC1. [https://www.dropbox.com/s/0qnyl552qvplc0e/Acirctuis.pdf?dl=0 circuit_notes.pdf] || [https://www.dropbox.com/s/z54tjl4a5rswmhd/prob_6.pdf?dl=0 Problem set 6]
|-
|| 17.10 || Classes L, NL, PSPACE and NPSPACE. Inclusions between P, NP, and PSPACE. Cook–Levin theorem, NP-completeness of: subsetsum, set-splitting, 3-colorability and exactly 1-in-3 SAT. || [https://www.dropbox.com/s/y8rv53yz2he58uf/prob_7.pdf?dl=0 Problem set 7]
|-
|| 31.10 || Directed Reachability is in SPACE(log^2 n). TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) for space constructible s. PSPACE completeness of generalized geography. || [https://www.dropbox.com/s/d8svos0sn0d53ys/prob_08.pdf?dl=0 Problem set 8]
|-
||07.11 || Oracle computation definitions. There exists an oracle ''A'' for which P''A'' = NP''A''. There is an oracle B such that P''B'' is not equal to NP''B''. || [https://www.dropbox.com/s/qym967max8yxhsn/prob_9.pdf?dl=0 Problem set 9]update 23.11
|-
|| 14.11 || Probabilistic computation. Probabilistic machines, the class BPP, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Most of it is also [https://www.youtube.com/watch?v=YSMgVbOqB-8&list=PLm3J0oaFux3YL5vLXpzOyJiLtqLp6dCW2&index=23 here]|| [https://www.dropbox.com/s/zg1f51ryxliz2s9/prob_10.pdf?dl=0 Problem set 10]
|-
|| 21.11 || Streaming algorithms: finding the majority element, computation of the number of different elements  in logarithmic space. See Chapts 6.1-6.2 in [https://home.ttic.edu/~avrim/book.pdf foundations of datascience] by Avrim Blum and others. Another nice chapter in [http://theory.stanford.edu/~tim/w15/l/l1.pdf Tim Roughgarden's lecture notes] || [https://www.dropbox.com/s/r3zzgjyw07ltz2b/prob_11.pdf?dl=0 Problem set 11] update 21.11
|-
|| 28.11 || More streaming algorithms: calculation F_0 moments, Hash functions, finding the frequent items in streams of data: SpaceSaving. || [https://www.dropbox.com/s/he8ws0ldovhenhh/prob_12.pdf?dl=0 Problem set 12]
|-
|| 05.12 || Colloquium. ||
|-
|| 12.12 || Approximation algorithms and complexity of clustering [https://www.dropbox.com/s/wvtcsl6crkj8zeq/tc-12-approximation.pdf?dl=0 Slides.]
|| [https://www.dropbox.com/s/37gdsbv2it8omnm/tc-sample-exam.pdf?dl=0 Sample exam]
|}

For interested students: parameterized complexity. We review topics from chapters 1, 2, 3, 13 in "Parameterized algorithms" by Cygan, Fomin and others, 2016.

19 Sept: Fixed parameter tracktability and examples. Kernels. [https://www.dropbox.com/s/zzzaulpmzql7x7u/parameterizedComplexity.pdf?dl=0 presentation].

26 Sept: feedback vertex set, linear programming kernel for vertex cover, k-path problem, exercises on chapters 2 and 3.

3 Oct: Lower bounds using the exponential time hypothesis. [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] from a nice [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms course]

= Project (for PI students) =

During the 3rd module Januari till March 2023. The task is to understand a theoretical paper better by either

(Th) Rewrite some mathematical proof of a research paper in a more accessible way using your own words. You also need to give a lecture (you are not allowed to look at the paper during the lecture). I need to work out examples. Possibly examples that I give you on the spot.

(Imp) Implement an algorithm (or parts of an algorithm) from a research paper and demonstrate that it works.

Here are examples of each type concerning the vertex cover problem:

(Th) prove lemma 4.1 of the paper https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.127 , you need to study some parameterized complexity, see below the table with course materials for references.

(Th) prove theorem 5 from https://www.researchgate.net/profile/Lars-Jaffke/publication/329181540_What_is_known_about_Vertex_Cover_Kernelization/links/5cb319df92851c8d22ea17b6/What-is-known-about-Vertex-Cover-Kernelization.pdf

(Imp) implement a kernel and a simple branch and bound variant from https://arxiv.org/pdf/1908.06795.pdf, as well as compare your algorithm with the results in the contest https://pacechallenge.org/2019/vc/vc_exact/

You can propose projects yourself, but it is not allowed to have a theoretical paper about software verification. (Because there are too many definitions, and during the lecture it usually turns out the student does not understand them.)

= Additional reading =

Both books contain a lot of extra materials and describe more recent discoveries in computational complexity. The first book has a gentel and pleasant style. The second book is a rigurous textbook for students theoretical computer science at the beginning master level.

C. Moore and S. Mertens, The nature of computation, 2011.

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

= Grading =

For AMI students:

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] 

For PI students (the course is called "computational complexity" and takes 3 modules):

Final score = 0.25 * [score homework] + 0.25 * [score colloquium] + 0.25 * [score exam] + 0.25 * [score project] 

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra point on the final exam. There will be around 6 extra problems.

= Colloquium =

December 5, 13h00 -- 16h00, room D206 (room D102 after 14h40)

[https://www.dropbox.com/s/sk6df3zl4sxehwz/col.pdf?dl=0 rules and questions] (updated 25.11)

= Office hours =

Bruno Bauwens: Mondays 14h30-20h. Fridays 18h-20h. You can warn in advance by emailing to brbauwens -a- gmail.com

Alexey Talambutsa: First contact by email.

Theory of Computation 2022

2022-12-28T17:00:22Z

Bbauwens:

= Feedback exam =

Feedback exam: Friday 30.12 at 14h on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom])

= Exam =

Date: Tuesday December 20th, 13h-16h, D501

The exam consists out of 8 exercises that you must solve in 3 hours time.

There will be copies of Sipser's book available (as well as Arora and Barak and Mertens and Moore). You may bring your own copy if you have it, as well as handwritten notes.

= Classes =

Lectures: Monday 13:00 - 14:20 in Pokrovkaya and on this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] by [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/191486005 Alexey Talambutsa]

Seminars: Monday 14:40 - 16:00 in Pokrovkaya and on [https://us06web.zoom.us/j/82302406358?pwd=OFMyS2E4SVZaWFZaeXFsWHRFMWROZz09 zoomlink] by [https://www.hse.ru/en/org/persons/208499388 Pavel Zakharov]

= Dates and Deadlines =

Homeworks 1, 2, 3: <s>September 26</s> '''October 3''' (update of 2.7 and 3.7 on 26/09)

Homeworks 4, 5: October 10

Homeworks 6, 7, 8: November 7

Homeworks 9, 10, 11: November 28

Submit homework in google classroom in this [https://classroom.google.com/c/NTQ5OTYyMzk3ODc0?cjc=27kcgjp link], code: 27kcgjp You should upload either scanned handwriting or pdf file into the corresponding section.

Table with [https://docs.google.com/spreadsheets/d/1J_mJJlr52xKDAGXF_4Rr-qdsW-q3p4XPzJVE-WDrxsk/edit?usp=sharing grades]


= Course Materials =

The main reference is Sipser's book "Introduction to the theory of computation", chapters 3, 4, 7–10.

For students abroad: the first 5 lectures are covered in chapters 3, 4, 7 and 9.1. Other lectures will be recorded. See also recordings of [http://wiki.cs.hse.ru/Theory_of_Computation_2021 previous year].

If you need some background in math, consider these two sources: 
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi 
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

{| class="wikitable"
|-
! !! Summary !! Problem list
|-
|| 05.09 || Turing machines, multitape Turing machines, connection between them. Universal Turing machine. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. || [https://www.dropbox.com/s/9n9ihiti0yufvc8/prob_1.pdf?dl=0 Problem set 1]
|-
|| 12.09 || Time and space hierarchy theorems. Time and space constructible functions. || [https://www.dropbox.com/s/jqz33aqwfl992tc/prob_2.pdf?dl=0 Problem set 2] update 26.09
|-
|| 19.09 || Because of various problems, the materials of last 2 weeks were repeated. || [https://www.dropbox.com/s/05iiwsdpggfjuul/prob_3.pdf?dl=0 Problem set 3] update 25.09
|-
|| 26.09 || Complexity class NP. Examples. Polynomial reductions. NP-hardness and NP-completeness. || [https://www.dropbox.com/s/454bok6rvsdtfix/prob_4.pdf?dl=0 Problem set 4]
|-
|| 3.10 || Non-deterministic TMs. Another definition of NP. Proving NP-hardness by reduction from an NP-complete problem. Examples of NP-complete problems. HAMPATH is NP-complete || [https://www.dropbox.com/s/y4ktp5e2tjryqwr/prob_5.pdf?dl=0 Problem set 5]
|-
|| 10.10 || Circuit complexity. Classes AC^i, NC^i, P/poly. All functions are computed by circuits. Existence of functions with exponential circuit complexity. NC1 = Boolean formulas of polynomial size. P is in P/poly. Addition in AC0. Multiplication is in NC1. [https://www.dropbox.com/s/0qnyl552qvplc0e/Acirctuis.pdf?dl=0 circuit_notes.pdf] || [https://www.dropbox.com/s/z54tjl4a5rswmhd/prob_6.pdf?dl=0 Problem set 6]
|-
|| 17.10 || Classes L, NL, PSPACE and NPSPACE. Inclusions between P, NP, and PSPACE. Cook–Levin theorem, NP-completeness of: subsetsum, set-splitting, 3-colorability and exactly 1-in-3 SAT. || [https://www.dropbox.com/s/y8rv53yz2he58uf/prob_7.pdf?dl=0 Problem set 7]
|-
|| 31.10 || Directed Reachability is in SPACE(log^2 n). TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) for space constructible s. PSPACE completeness of generalized geography. || [https://www.dropbox.com/s/d8svos0sn0d53ys/prob_08.pdf?dl=0 Problem set 8]
|-
||07.11 || Oracle computation definitions. There exists an oracle ''A'' for which P''A'' = NP''A''. There is an oracle B such that P''B'' is not equal to NP''B''. || [https://www.dropbox.com/s/qym967max8yxhsn/prob_9.pdf?dl=0 Problem set 9]update 23.11
|-
|| 14.11 || Probabilistic computation. Probabilistic machines, the class BPP, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Most of it is also [https://www.youtube.com/watch?v=YSMgVbOqB-8&list=PLm3J0oaFux3YL5vLXpzOyJiLtqLp6dCW2&index=23 here]|| [https://www.dropbox.com/s/zg1f51ryxliz2s9/prob_10.pdf?dl=0 Problem set 10]
|-
|| 21.11 || Streaming algorithms: finding the majority element, computation of the number of different elements  in logarithmic space. See Chapts 6.1-6.2 in [https://home.ttic.edu/~avrim/book.pdf foundations of datascience] by Avrim Blum and others. Another nice chapter in [http://theory.stanford.edu/~tim/w15/l/l1.pdf Tim Roughgarden's lecture notes] || [https://www.dropbox.com/s/r3zzgjyw07ltz2b/prob_11.pdf?dl=0 Problem set 11] update 21.11
|-
|| 28.11 || More streaming algorithms: calculation F_0 moments, Hash functions, finding the frequent items in streams of data: SpaceSaving. || [https://www.dropbox.com/s/he8ws0ldovhenhh/prob_12.pdf?dl=0 Problem set 12]
|-
|| 05.12 || Colloquium. ||
|-
|| 12.12 || Approximation algorithms and complexity of clustering [https://www.dropbox.com/s/wvtcsl6crkj8zeq/tc-12-approximation.pdf?dl=0 Slides.]
|| [https://www.dropbox.com/s/37gdsbv2it8omnm/tc-sample-exam.pdf?dl=0 Sample exam]
|}

For interested students: parameterized complexity. We review topics from chapters 1, 2, 3, 13 in "Parameterized algorithms" by Cygan, Fomin and others, 2016.

19 Sept: Fixed parameter tracktability and examples. Kernels. [https://www.dropbox.com/s/zzzaulpmzql7x7u/parameterizedComplexity.pdf?dl=0 presentation].

26 Sept: feedback vertex set, linear programming kernel for vertex cover, k-path problem, exercises on chapters 2 and 3.

3 Oct: Lower bounds using the exponential time hypothesis. [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] from a nice [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms course]

= Project (for PI students) =

During the 3rd module Januari till March 2023. The task is to understand a theoretical paper better by either

(Th) Rewrite some mathematical proof of a research paper in a more accessible way using your own words. You also need to give a lecture (you are not allowed to look at the paper during the lecture). I need to work out examples. Possibly examples that I give you on the spot.

(Imp) Implement an algorithm (or parts of an algorithm) from a research paper and demonstrate that it works.

Here are examples of each type concerning the vertex cover problem:

(Th) prove lemma 4.1 of the paper https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.127 , you need to study some parameterized complexity, see below the table with course materials for references.

(Th) prove theorem 5 from https://www.researchgate.net/profile/Lars-Jaffke/publication/329181540_What_is_known_about_Vertex_Cover_Kernelization/links/5cb319df92851c8d22ea17b6/What-is-known-about-Vertex-Cover-Kernelization.pdf

(Imp) implement a kernel and a simple branch and bound variant from https://arxiv.org/pdf/1908.06795.pdf, as well as compare your algorithm with the results in the contest https://pacechallenge.org/2019/vc/vc_exact/

You can propose projects yourself, but it is not allowed to have a theoretical paper about software verification. (Because there are too many definitions, and during the lecture it usually turns out the student does not understand them.)

= Additional reading =

Both books contain a lot of extra materials and describe more recent discoveries in computational complexity. The first book has a gentel and pleasant style. The second book is a rigurous textbook for students theoretical computer science at the beginning master level.

C. Moore and S. Mertens, The nature of computation, 2011.

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

= Grading =

For AMI students:

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] 

For PI students (the course is called "computational complexity" and takes 3 modules):

Final score = 0.25 * [score homework] + 0.25 * [score colloquium] + 0.25 * [score exam] + 0.25 * [score project] 

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra point on the final exam. There will be around 6 extra problems.

= Colloquium =

December 5, 13h00 -- 16h00, room D206 (room D102 after 14h40)

[https://www.dropbox.com/s/sk6df3zl4sxehwz/col.pdf?dl=0 rules and questions] (updated 25.11)

= Office hours =

Bruno Bauwens: Mondays 14h30-20h. Fridays 18h-20h. You can warn in advance by emailing to brbauwens -a- gmail.com

Alexey Talambutsa: First contact by email.

Theory of Computation 2022

2022-12-28T16:59:59Z

Bbauwens:

Feedback exam: Friday 30.12 at 14h on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom])

= Exam =

Date: Tuesday December 20th, 13h-16h, D501

The exam consists out of 8 exercises that you must solve in 3 hours time.

There will be copies of Sipser's book available (as well as Arora and Barak and Mertens and Moore). You may bring your own copy if you have it, as well as handwritten notes.

= Classes =

Lectures: Monday 13:00 - 14:20 in Pokrovkaya and on this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] by [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/191486005 Alexey Talambutsa]

Seminars: Monday 14:40 - 16:00 in Pokrovkaya and on [https://us06web.zoom.us/j/82302406358?pwd=OFMyS2E4SVZaWFZaeXFsWHRFMWROZz09 zoomlink] by [https://www.hse.ru/en/org/persons/208499388 Pavel Zakharov]

= Dates and Deadlines =

Homeworks 1, 2, 3: <s>September 26</s> '''October 3''' (update of 2.7 and 3.7 on 26/09)

Homeworks 4, 5: October 10

Homeworks 6, 7, 8: November 7

Homeworks 9, 10, 11: November 28

Submit homework in google classroom in this [https://classroom.google.com/c/NTQ5OTYyMzk3ODc0?cjc=27kcgjp link], code: 27kcgjp You should upload either scanned handwriting or pdf file into the corresponding section.

Table with [https://docs.google.com/spreadsheets/d/1J_mJJlr52xKDAGXF_4Rr-qdsW-q3p4XPzJVE-WDrxsk/edit?usp=sharing grades]


= Course Materials =

The main reference is Sipser's book "Introduction to the theory of computation", chapters 3, 4, 7–10.

For students abroad: the first 5 lectures are covered in chapters 3, 4, 7 and 9.1. Other lectures will be recorded. See also recordings of [http://wiki.cs.hse.ru/Theory_of_Computation_2021 previous year].

If you need some background in math, consider these two sources: 
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi 
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

{| class="wikitable"
|-
! !! Summary !! Problem list
|-
|| 05.09 || Turing machines, multitape Turing machines, connection between them. Universal Turing machine. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. || [https://www.dropbox.com/s/9n9ihiti0yufvc8/prob_1.pdf?dl=0 Problem set 1]
|-
|| 12.09 || Time and space hierarchy theorems. Time and space constructible functions. || [https://www.dropbox.com/s/jqz33aqwfl992tc/prob_2.pdf?dl=0 Problem set 2] update 26.09
|-
|| 19.09 || Because of various problems, the materials of last 2 weeks were repeated. || [https://www.dropbox.com/s/05iiwsdpggfjuul/prob_3.pdf?dl=0 Problem set 3] update 25.09
|-
|| 26.09 || Complexity class NP. Examples. Polynomial reductions. NP-hardness and NP-completeness. || [https://www.dropbox.com/s/454bok6rvsdtfix/prob_4.pdf?dl=0 Problem set 4]
|-
|| 3.10 || Non-deterministic TMs. Another definition of NP. Proving NP-hardness by reduction from an NP-complete problem. Examples of NP-complete problems. HAMPATH is NP-complete || [https://www.dropbox.com/s/y4ktp5e2tjryqwr/prob_5.pdf?dl=0 Problem set 5]
|-
|| 10.10 || Circuit complexity. Classes AC^i, NC^i, P/poly. All functions are computed by circuits. Existence of functions with exponential circuit complexity. NC1 = Boolean formulas of polynomial size. P is in P/poly. Addition in AC0. Multiplication is in NC1. [https://www.dropbox.com/s/0qnyl552qvplc0e/Acirctuis.pdf?dl=0 circuit_notes.pdf] || [https://www.dropbox.com/s/z54tjl4a5rswmhd/prob_6.pdf?dl=0 Problem set 6]
|-
|| 17.10 || Classes L, NL, PSPACE and NPSPACE. Inclusions between P, NP, and PSPACE. Cook–Levin theorem, NP-completeness of: subsetsum, set-splitting, 3-colorability and exactly 1-in-3 SAT. || [https://www.dropbox.com/s/y8rv53yz2he58uf/prob_7.pdf?dl=0 Problem set 7]
|-
|| 31.10 || Directed Reachability is in SPACE(log^2 n). TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) for space constructible s. PSPACE completeness of generalized geography. || [https://www.dropbox.com/s/d8svos0sn0d53ys/prob_08.pdf?dl=0 Problem set 8]
|-
||07.11 || Oracle computation definitions. There exists an oracle ''A'' for which P''A'' = NP''A''. There is an oracle B such that P''B'' is not equal to NP''B''. || [https://www.dropbox.com/s/qym967max8yxhsn/prob_9.pdf?dl=0 Problem set 9]update 23.11
|-
|| 14.11 || Probabilistic computation. Probabilistic machines, the class BPP, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Most of it is also [https://www.youtube.com/watch?v=YSMgVbOqB-8&list=PLm3J0oaFux3YL5vLXpzOyJiLtqLp6dCW2&index=23 here]|| [https://www.dropbox.com/s/zg1f51ryxliz2s9/prob_10.pdf?dl=0 Problem set 10]
|-
|| 21.11 || Streaming algorithms: finding the majority element, computation of the number of different elements  in logarithmic space. See Chapts 6.1-6.2 in [https://home.ttic.edu/~avrim/book.pdf foundations of datascience] by Avrim Blum and others. Another nice chapter in [http://theory.stanford.edu/~tim/w15/l/l1.pdf Tim Roughgarden's lecture notes] || [https://www.dropbox.com/s/r3zzgjyw07ltz2b/prob_11.pdf?dl=0 Problem set 11] update 21.11
|-
|| 28.11 || More streaming algorithms: calculation F_0 moments, Hash functions, finding the frequent items in streams of data: SpaceSaving. || [https://www.dropbox.com/s/he8ws0ldovhenhh/prob_12.pdf?dl=0 Problem set 12]
|-
|| 05.12 || Colloquium. ||
|-
|| 12.12 || Approximation algorithms and complexity of clustering [https://www.dropbox.com/s/wvtcsl6crkj8zeq/tc-12-approximation.pdf?dl=0 Slides.]
|| [https://www.dropbox.com/s/37gdsbv2it8omnm/tc-sample-exam.pdf?dl=0 Sample exam]
|}

For interested students: parameterized complexity. We review topics from chapters 1, 2, 3, 13 in "Parameterized algorithms" by Cygan, Fomin and others, 2016.

19 Sept: Fixed parameter tracktability and examples. Kernels. [https://www.dropbox.com/s/zzzaulpmzql7x7u/parameterizedComplexity.pdf?dl=0 presentation].

26 Sept: feedback vertex set, linear programming kernel for vertex cover, k-path problem, exercises on chapters 2 and 3.

3 Oct: Lower bounds using the exponential time hypothesis. [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] from a nice [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms course]

= Project (for PI students) =

During the 3rd module Januari till March 2023. The task is to understand a theoretical paper better by either

(Th) Rewrite some mathematical proof of a research paper in a more accessible way using your own words. You also need to give a lecture (you are not allowed to look at the paper during the lecture). I need to work out examples. Possibly examples that I give you on the spot.

(Imp) Implement an algorithm (or parts of an algorithm) from a research paper and demonstrate that it works.

Here are examples of each type concerning the vertex cover problem:

(Th) prove lemma 4.1 of the paper https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.127 , you need to study some parameterized complexity, see below the table with course materials for references.

(Th) prove theorem 5 from https://www.researchgate.net/profile/Lars-Jaffke/publication/329181540_What_is_known_about_Vertex_Cover_Kernelization/links/5cb319df92851c8d22ea17b6/What-is-known-about-Vertex-Cover-Kernelization.pdf

(Imp) implement a kernel and a simple branch and bound variant from https://arxiv.org/pdf/1908.06795.pdf, as well as compare your algorithm with the results in the contest https://pacechallenge.org/2019/vc/vc_exact/

You can propose projects yourself, but it is not allowed to have a theoretical paper about software verification. (Because there are too many definitions, and during the lecture it usually turns out the student does not understand them.)

= Additional reading =

Both books contain a lot of extra materials and describe more recent discoveries in computational complexity. The first book has a gentel and pleasant style. The second book is a rigurous textbook for students theoretical computer science at the beginning master level.

C. Moore and S. Mertens, The nature of computation, 2011.

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

= Grading =

For AMI students:

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] 

For PI students (the course is called "computational complexity" and takes 3 modules):

Final score = 0.25 * [score homework] + 0.25 * [score colloquium] + 0.25 * [score exam] + 0.25 * [score project] 

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra point on the final exam. There will be around 6 extra problems.

= Colloquium =

December 5, 13h00 -- 16h00, room D206 (room D102 after 14h40)

[https://www.dropbox.com/s/sk6df3zl4sxehwz/col.pdf?dl=0 rules and questions] (updated 25.11)

= Office hours =

Bruno Bauwens: Mondays 14h30-20h. Fridays 18h-20h. You can warn in advance by emailing to brbauwens -a- gmail.com

Alexey Talambutsa: First contact by email.

Theory of Computation 2022

2022-12-23T18:01:39Z

Bbauwens:

= Exam =

Date: Tuesday December 20th, 13h-16h, D501

The exam consists out of 8 exercises that you must solve in 3 hours time.

There will be copies of Sipser's book available (as well as Arora and Barak and Mertens and Moore). You may bring your own copy if you have it, as well as handwritten notes.

= Classes =

Lectures: Monday 13:00 - 14:20 in Pokrovkaya and on this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] by [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/191486005 Alexey Talambutsa]

Seminars: Monday 14:40 - 16:00 in Pokrovkaya and on [https://us06web.zoom.us/j/82302406358?pwd=OFMyS2E4SVZaWFZaeXFsWHRFMWROZz09 zoomlink] by [https://www.hse.ru/en/org/persons/208499388 Pavel Zakharov]

= Dates and Deadlines =

Homeworks 1, 2, 3: <s>September 26</s> '''October 3''' (update of 2.7 and 3.7 on 26/09)

Homeworks 4, 5: October 10

Homeworks 6, 7, 8: November 7

Homeworks 9, 10, 11: November 28 (update of 11.6 and 11.7 on 21/11, 9.9 on 23.11)

Submit homework in google classroom in this [https://classroom.google.com/c/NTQ5OTYyMzk3ODc0?cjc=27kcgjp link], code: 27kcgjp You should upload either scanned handwriting or pdf file into the corresponding section.

Table with [https://docs.google.com/spreadsheets/d/1J_mJJlr52xKDAGXF_4Rr-qdsW-q3p4XPzJVE-WDrxsk/edit?usp=sharing grades]


= Course Materials =

The main reference is Sipser's book "Introduction to the theory of computation", chapters 3, 4, 7–10.

For students abroad: the first 5 lectures are covered in chapters 3, 4, 7 and 9.1. Other lectures will be recorded. See also recordings of [http://wiki.cs.hse.ru/Theory_of_Computation_2021 previous year].

If you need some background in math, consider these two sources: 
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi 
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

{| class="wikitable"
|-
! !! Summary !! Problem list
|-
|| 05.09 || Turing machines, multitape Turing machines, connection between them. Universal Turing machine. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. || [https://www.dropbox.com/s/9n9ihiti0yufvc8/prob_1.pdf?dl=0 Problem set 1]
|-
|| 12.09 || Time and space hierarchy theorems. Time and space constructible functions. || [https://www.dropbox.com/s/jqz33aqwfl992tc/prob_2.pdf?dl=0 Problem set 2] update 26.09
|-
|| 19.09 || Because of various problems, the materials of last 2 weeks were repeated. || [https://www.dropbox.com/s/05iiwsdpggfjuul/prob_3.pdf?dl=0 Problem set 3] update 25.09
|-
|| 26.09 || Complexity class NP. Examples. Polynomial reductions. NP-hardness and NP-completeness. || [https://www.dropbox.com/s/454bok6rvsdtfix/prob_4.pdf?dl=0 Problem set 4]
|-
|| 3.10 || Non-deterministic TMs. Another definition of NP. Proving NP-hardness by reduction from an NP-complete problem. Examples of NP-complete problems. HAMPATH is NP-complete || [https://www.dropbox.com/s/y4ktp5e2tjryqwr/prob_5.pdf?dl=0 Problem set 5]
|-
|| 10.10 || Circuit complexity. Classes AC^i, NC^i, P/poly. All functions are computed by circuits. Existence of functions with exponential circuit complexity. NC1 = Boolean formulas of polynomial size. P is in P/poly. Addition in AC0. Multiplication is in NC1. [https://www.dropbox.com/s/0qnyl552qvplc0e/Acirctuis.pdf?dl=0 circuit_notes.pdf] || [https://www.dropbox.com/s/z54tjl4a5rswmhd/prob_6.pdf?dl=0 Problem set 6]
|-
|| 17.10 || Classes L, NL, PSPACE and NPSPACE. Inclusions between P, NP, and PSPACE. Cook–Levin theorem, NP-completeness of: subsetsum, set-splitting, 3-colorability and exactly 1-in-3 SAT. || [https://www.dropbox.com/s/y8rv53yz2he58uf/prob_7.pdf?dl=0 Problem set 7]
|-
|| 31.10 || Directed Reachability is in SPACE(log^2 n). TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) for space constructible s. PSPACE completeness of generalized geography. || [https://www.dropbox.com/s/d8svos0sn0d53ys/prob_08.pdf?dl=0 Problem set 8]
|-
||07.11 || Oracle computation definitions. There exists an oracle ''A'' for which P''A'' = NP''A''. There is an oracle B such that P''B'' is not equal to NP''B''. || [https://www.dropbox.com/s/qym967max8yxhsn/prob_9.pdf?dl=0 Problem set 9]update 23.11
|-
|| 14.11 || Probabilistic computation. Probabilistic machines, the class BPP, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Most of it is also [https://www.youtube.com/watch?v=YSMgVbOqB-8&list=PLm3J0oaFux3YL5vLXpzOyJiLtqLp6dCW2&index=23 here]|| [https://www.dropbox.com/s/zg1f51ryxliz2s9/prob_10.pdf?dl=0 Problem set 10]
|-
|| 21.11 || Streaming algorithms: finding the majority element, computation of the number of different elements  in logarithmic space. See Chapts 6.1-6.2 in [https://home.ttic.edu/~avrim/book.pdf foundations of datascience] by Avrim Blum and others. Another nice chapter in [http://theory.stanford.edu/~tim/w15/l/l1.pdf Tim Roughgarden's lecture notes] || [https://www.dropbox.com/s/r3zzgjyw07ltz2b/prob_11.pdf?dl=0 Problem set 11] update 21.11
|-
|| 28.11 || More streaming algorithms: calculation F_0 moments, Hash functions, finding the frequent items in streams of data: SpaceSaving. || [https://www.dropbox.com/s/he8ws0ldovhenhh/prob_12.pdf?dl=0 Problem set 12]
|-
|| 05.12 || Colloquium. ||
|-
|| 12.12 || Approximation algorithms and complexity of clustering [https://www.dropbox.com/s/wvtcsl6crkj8zeq/tc-12-approximation.pdf?dl=0 Slides.]
|| [https://www.dropbox.com/s/37gdsbv2it8omnm/tc-sample-exam.pdf?dl=0 Sample exam]
|}

For interested students: parameterized complexity. We review topics from chapters 1, 2, 3, 13 in "Parameterized algorithms" by Cygan, Fomin and others, 2016.

19 Sept: Fixed parameter tracktability and examples. Kernels. [https://www.dropbox.com/s/zzzaulpmzql7x7u/parameterizedComplexity.pdf?dl=0 presentation].

26 Sept: feedback vertex set, linear programming kernel for vertex cover, k-path problem, exercises on chapters 2 and 3.

3 Oct: Lower bounds using the exponential time hypothesis. [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] from a nice [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms course]

= Project (for PI students) =

During the 3rd module Januari till March 2023. The task is to understand a theoretical paper better by either

(Th) Rewrite some mathematical proof of a research paper in a more accessible way using your own words. You also need to give a lecture (you are not allowed to look at the paper during the lecture). I need to work out examples. Possibly examples that I give you on the spot.

(Imp) Implement an algorithm (or parts of an algorithm) from a research paper and demonstrate that it works.

Here are examples of each type concerning the vertex cover problem:

(Th) prove lemma 4.1 of the paper https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.127 , you need to study some parameterized complexity, see below the table with course materials for references.

(Th) prove theorem 5 from https://www.researchgate.net/profile/Lars-Jaffke/publication/329181540_What_is_known_about_Vertex_Cover_Kernelization/links/5cb319df92851c8d22ea17b6/What-is-known-about-Vertex-Cover-Kernelization.pdf

(Imp) implement a kernel and a simple branch and bound variant from https://arxiv.org/pdf/1908.06795.pdf, as well as compare your algorithm with the results in the contest https://pacechallenge.org/2019/vc/vc_exact/

You can propose projects yourself, but it is not allowed to have a theoretical paper about software verification. (Because there are too many definitions, and during the lecture it usually turns out the student does not understand them.)

= Additional reading =

Both books contain a lot of extra materials and describe more recent discoveries in computational complexity. The first book has a gentel and pleasant style. The second book is a rigurous textbook for students theoretical computer science at the beginning master level.

C. Moore and S. Mertens, The nature of computation, 2011.

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

= Grading =

For AMI students:

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] 

For PI students (the course is called "computational complexity" and takes 3 modules):

Final score = 0.25 * [score homework] + 0.25 * [score colloquium] + 0.25 * [score exam] + 0.25 * [score project] 

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra point on the final exam. There will be around 6 extra problems.

= Colloquium =

December 5, 13h00 -- 16h00, room D206 (room D102 after 14h40)

[https://www.dropbox.com/s/sk6df3zl4sxehwz/col.pdf?dl=0 rules and questions] (updated 25.11)

= Office hours =

Bruno Bauwens: Mondays 14h30-20h. Fridays 18h-20h. You can warn in advance by emailing to brbauwens -a- gmail.com

Alexey Talambutsa: First contact by email.

Theory of Computation 2022

2022-12-23T18:01:15Z

Bbauwens:

= Exam =

Date: Tuesday December 20th, 13h-16h, D501

The exam consists out of 8 exercises that you must solve in 3 hours time.

There will be copies of Sipser's book available (as well as Arora and Barak and Mertens and Moore). You may bring your own copy if you have it, as well as handwritten notes.

Students abroad are allowed to do the exam online using this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink]

= Classes =

Lectures: Monday 13:00 - 14:20 in Pokrovkaya and on this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] by [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/191486005 Alexey Talambutsa]

Seminars: Monday 14:40 - 16:00 in Pokrovkaya and on [https://us06web.zoom.us/j/82302406358?pwd=OFMyS2E4SVZaWFZaeXFsWHRFMWROZz09 zoomlink] by [https://www.hse.ru/en/org/persons/208499388 Pavel Zakharov]

= Dates and Deadlines =

Homeworks 1, 2, 3: <s>September 26</s> '''October 3''' (update of 2.7 and 3.7 on 26/09)

Homeworks 4, 5: October 10

Homeworks 6, 7, 8: November 7

Homeworks 9, 10, 11: November 28 (update of 11.6 and 11.7 on 21/11, 9.9 on 23.11)

Submit homework in google classroom in this [https://classroom.google.com/c/NTQ5OTYyMzk3ODc0?cjc=27kcgjp link], code: 27kcgjp You should upload either scanned handwriting or pdf file into the corresponding section.

Table with [https://docs.google.com/spreadsheets/d/1J_mJJlr52xKDAGXF_4Rr-qdsW-q3p4XPzJVE-WDrxsk/edit?usp=sharing grades]


= Course Materials =

The main reference is Sipser's book "Introduction to the theory of computation", chapters 3, 4, 7–10.

For students abroad: the first 5 lectures are covered in chapters 3, 4, 7 and 9.1. Other lectures will be recorded. See also recordings of [http://wiki.cs.hse.ru/Theory_of_Computation_2021 previous year].

If you need some background in math, consider these two sources: 
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi 
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

{| class="wikitable"
|-
! !! Summary !! Problem list
|-
|| 05.09 || Turing machines, multitape Turing machines, connection between them. Universal Turing machine. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. || [https://www.dropbox.com/s/9n9ihiti0yufvc8/prob_1.pdf?dl=0 Problem set 1]
|-
|| 12.09 || Time and space hierarchy theorems. Time and space constructible functions. || [https://www.dropbox.com/s/jqz33aqwfl992tc/prob_2.pdf?dl=0 Problem set 2] update 26.09
|-
|| 19.09 || Because of various problems, the materials of last 2 weeks were repeated. || [https://www.dropbox.com/s/05iiwsdpggfjuul/prob_3.pdf?dl=0 Problem set 3] update 25.09
|-
|| 26.09 || Complexity class NP. Examples. Polynomial reductions. NP-hardness and NP-completeness. || [https://www.dropbox.com/s/454bok6rvsdtfix/prob_4.pdf?dl=0 Problem set 4]
|-
|| 3.10 || Non-deterministic TMs. Another definition of NP. Proving NP-hardness by reduction from an NP-complete problem. Examples of NP-complete problems. HAMPATH is NP-complete || [https://www.dropbox.com/s/y4ktp5e2tjryqwr/prob_5.pdf?dl=0 Problem set 5]
|-
|| 10.10 || Circuit complexity. Classes AC^i, NC^i, P/poly. All functions are computed by circuits. Existence of functions with exponential circuit complexity. NC1 = Boolean formulas of polynomial size. P is in P/poly. Addition in AC0. Multiplication is in NC1. [https://www.dropbox.com/s/0qnyl552qvplc0e/Acirctuis.pdf?dl=0 circuit_notes.pdf] || [https://www.dropbox.com/s/z54tjl4a5rswmhd/prob_6.pdf?dl=0 Problem set 6]
|-
|| 17.10 || Classes L, NL, PSPACE and NPSPACE. Inclusions between P, NP, and PSPACE. Cook–Levin theorem, NP-completeness of: subsetsum, set-splitting, 3-colorability and exactly 1-in-3 SAT. || [https://www.dropbox.com/s/y8rv53yz2he58uf/prob_7.pdf?dl=0 Problem set 7]
|-
|| 31.10 || Directed Reachability is in SPACE(log^2 n). TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) for space constructible s. PSPACE completeness of generalized geography. || [https://www.dropbox.com/s/d8svos0sn0d53ys/prob_08.pdf?dl=0 Problem set 8]
|-
||07.11 || Oracle computation definitions. There exists an oracle ''A'' for which P''A'' = NP''A''. There is an oracle B such that P''B'' is not equal to NP''B''. || [https://www.dropbox.com/s/qym967max8yxhsn/prob_9.pdf?dl=0 Problem set 9]update 23.11
|-
|| 14.11 || Probabilistic computation. Probabilistic machines, the class BPP, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Most of it is also [https://www.youtube.com/watch?v=YSMgVbOqB-8&list=PLm3J0oaFux3YL5vLXpzOyJiLtqLp6dCW2&index=23 here]|| [https://www.dropbox.com/s/zg1f51ryxliz2s9/prob_10.pdf?dl=0 Problem set 10]
|-
|| 21.11 || Streaming algorithms: finding the majority element, computation of the number of different elements  in logarithmic space. See Chapts 6.1-6.2 in [https://home.ttic.edu/~avrim/book.pdf foundations of datascience] by Avrim Blum and others. Another nice chapter in [http://theory.stanford.edu/~tim/w15/l/l1.pdf Tim Roughgarden's lecture notes] || [https://www.dropbox.com/s/r3zzgjyw07ltz2b/prob_11.pdf?dl=0 Problem set 11] update 21.11
|-
|| 28.11 || More streaming algorithms: calculation F_0 moments, Hash functions, finding the frequent items in streams of data: SpaceSaving. || [https://www.dropbox.com/s/he8ws0ldovhenhh/prob_12.pdf?dl=0 Problem set 12]
|-
|| 05.12 || Colloquium. ||
|-
|| 12.12 || Approximation algorithms and complexity of clustering [https://www.dropbox.com/s/wvtcsl6crkj8zeq/tc-12-approximation.pdf?dl=0 Slides.]
|| [https://www.dropbox.com/s/37gdsbv2it8omnm/tc-sample-exam.pdf?dl=0 Sample exam]
|}

For interested students: parameterized complexity. We review topics from chapters 1, 2, 3, 13 in "Parameterized algorithms" by Cygan, Fomin and others, 2016.

19 Sept: Fixed parameter tracktability and examples. Kernels. [https://www.dropbox.com/s/zzzaulpmzql7x7u/parameterizedComplexity.pdf?dl=0 presentation].

26 Sept: feedback vertex set, linear programming kernel for vertex cover, k-path problem, exercises on chapters 2 and 3.

3 Oct: Lower bounds using the exponential time hypothesis. [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] from a nice [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms course]

= Project (for PI students) =

During the 3rd module Januari till March 2023. The task is to understand a theoretical paper better by either

(Th) Rewrite some mathematical proof of a research paper in a more accessible way using your own words. You also need to give a lecture (you are not allowed to look at the paper during the lecture). I need to work out examples. Possibly examples that I give you on the spot.

(Imp) Implement an algorithm (or parts of an algorithm) from a research paper and demonstrate that it works.

Here are examples of each type concerning the vertex cover problem:

(Th) prove lemma 4.1 of the paper https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.127 , you need to study some parameterized complexity, see below the table with course materials for references.

(Th) prove theorem 5 from https://www.researchgate.net/profile/Lars-Jaffke/publication/329181540_What_is_known_about_Vertex_Cover_Kernelization/links/5cb319df92851c8d22ea17b6/What-is-known-about-Vertex-Cover-Kernelization.pdf

(Imp) implement a kernel and a simple branch and bound variant from https://arxiv.org/pdf/1908.06795.pdf, as well as compare your algorithm with the results in the contest https://pacechallenge.org/2019/vc/vc_exact/

You can propose projects yourself, but it is not allowed to have a theoretical paper about software verification. (Because there are too many definitions, and during the lecture it usually turns out the student does not understand them.)

= Additional reading =

Both books contain a lot of extra materials and describe more recent discoveries in computational complexity. The first book has a gentel and pleasant style. The second book is a rigurous textbook for students theoretical computer science at the beginning master level.

C. Moore and S. Mertens, The nature of computation, 2011.

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

= Grading =

For AMI students:

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] 

For PI students (the course is called "computational complexity" and takes 3 modules):

Final score = 0.25 * [score homework] + 0.25 * [score colloquium] + 0.25 * [score exam] + 0.25 * [score project] 

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra point on the final exam. There will be around 6 extra problems.

= Colloquium =

December 5, 13h00 -- 16h00, room D206 (room D102 after 14h40)

[https://www.dropbox.com/s/sk6df3zl4sxehwz/col.pdf?dl=0 rules and questions] (updated 25.11)

= Office hours =

Bruno Bauwens: Mondays 14h30-20h. Fridays 18h-20h. You can warn in advance by emailing to brbauwens -a- gmail.com

Alexey Talambutsa: First contact by email.

Statistical learning theory 2022

2022-12-21T06:13:03Z

Bbauwens:

== General Information ==

Lectures: Friday 16h20 -- 17h40, [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], [https://www.hse.ru/staff/mkaledin Maxim Kaledin], room M202 and on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

Seminars: Saturday 14h40 -- 16h00, [https://www.hse.ru/org/persons/225526439 Artur Goldman], room M202 and on zoom (the link will be in telegram)

To discuss the materials, join the [https://t.me/+G0VKOE2-nnkwNDE0 telegram group] The course is similar to [http://wiki.cs.hse.ru/Statistical_learning_theory_2021 last year].

[https://www.dropbox.com/scl/fi/gz6fp21r2c2vvlykcy7vl/grades_dropbox.ods?dl=0&rlkey=ze8jxq139rgvz2t4bi6xlb86w grades]

== Problems exam ==

December 21, 13h-16h, computer room G403 ([https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] for students abroad) 
-- You may use handwritten notes, lecture materials from this wiki (either printed or through your PC), Mohri's book 
-- You may not search on the internet or interact with other humans (e.g. by phone, forums, etc)

== Course materials ==

{| class="wikitable"
|-
! Video !! Summary !! Slides !! Lecture notes !! Problem list !! Solutions
|-
|
|| ''Part 1. Online learning''
|-
| 02 Sept
|| Philosophy. The online mistake bound model. The halving and weighted majority algorithms [https://drive.google.com/drive/folders/1NXiLbhmO2Ml7jFmnLtjqhOgCoHg7yn9T?usp=sharing movies]
|| [https://www.dropbox.com/s/ryvpnfqfrwyurjc/01slides.pdf?dl=0 sl01]
|| [https://www.dropbox.com/s/oncvg4mxulbt56d/00book_intro.pdf?dl=0 ch00] [https://www.dropbox.com/s/i9pc4kf0zsdeksb/01book_onlineMistakeBound.pdf?dl=0 ch01]
|| [https://www.dropbox.com/s/ztk3n9s5c0vuzd9/01sem.pdf?dl=0 list 1] update 05.09
|| [https://www.dropbox.com/s/r528uroi60gow08/01sol.pdf?dl=0 solutions 1]
|-
| [https://drive.google.com/file/d/16OoCqhh16BKQzyF-HM8RozigyJ3BBVxA/view?usp=sharing 09 Sept]
|| The perceptron algorithm. The standard optimal algorithm.
|| [https://www.dropbox.com/s/sy959ee81mov5cr/02slides.pdf?dl=0 sl02]
|| [https://www.dropbox.com/s/p3auugqwc89132b/02book_sequentialOptimalAlgorithm.pdf?dl=0 ch02] [https://www.dropbox.com/s/b00dcqk1rob7rdz/03book_perceptron.pdf?dl=0 ch03]
|| [https://www.dropbox.com/s/88jgjvxo16zfrjs/02sem.pdf?dl=0 list 2] update 25.09
|| [https://www.dropbox.com/s/pqblktfky8to5hr/02sol.pdf?dl=0 solutions 2]
|-
| [https://www.youtube.com/watch?v=xgyPvnDkyZs 16 Sept]
|| Kernels and the kernel perceptron algorithm. Prediction with expert advice. Recap probability theory.
|| [https://www.dropbox.com/s/a60p9b76cxusgqy/03slides.pdf?dl=0 sl03]
|| [https://www.dropbox.com/s/3vtxvs4esnvbhlb/04book_predictionWithExperts.pdf?dl=0 ch04] [https://www.dropbox.com/s/l11afq1d0qn6za7/05book_introProbability.pdf?dl=0 ch05]
|| [https://www.dropbox.com/s/fnx2cl5wsgjbmel/03sem.pdf?dl=0 list 3]
|| [https://www.dropbox.com/s/ysg3nipuzryzqoc/03sol.pdf?dl=0 solutions 3]
|-
|
|| ''Part 2. Distribution independent risk bounds''
|-
| [https://www.youtube.com/watch?v=IatjLyN3dRk 23 Sept]
|| Sample complexity in the realizable setting, simple examples and bounds using VC-dimension
|| [https://www.dropbox.com/s/pi0f3wab1xna6d7/04slides.pdf?dl=0 sl04]
|| [https://www.dropbox.com/s/nh4puyv7nst4ems/06book_sampleComplexity.pdf?dl=0 ch06]
|| [https://www.dropbox.com/s/u5dtpm69bu52fpn/04sem.pdf?dl=0 list 4]
|| [https://www.dropbox.com/s/yurv5s42w3kw5vv/04sol.pdf?dl=0 solutions 4]
|-
| [https://www.youtube.com/watch?v=8J5B9CCy-ws 30 Sept]
|| Growth functions, VC-dimension and the characterization of sample comlexity with VC-dimensions
|| [https://www.dropbox.com/s/rpnh6288rdb3j8m/05slides.pdf?dl=0 sl05]
|| [https://www.dropbox.com/s/eurz2vkvt1wa5zm/07book_growthFunctions.pdf?dl=0 ch07] [https://www.dropbox.com/s/m7xe7k39qzmzapv/08book_VCdimension.pdf?dl=0 ch08]
|| [https://www.dropbox.com/s/u1vpi28gwf0zig4/05sem.pdf?dl=0 list 5]
|| [https://www.dropbox.com/s/3sq7yzv7v4l9tbb/05sol.pdf?dl=0 solutions 5]
|-
| [https://drive.google.com/file/d/17zynIg_CZ6cCNBig5QXmBx7VFS8peyuU/view?usp=sharing 07 Oct]
|| Risk decomposition and the fundamental theorem of statistical learning theory
|| [https://www.dropbox.com/s/0p8r5wgjy1hlku2/06slides.pdf?dl=0 sl06]
|| [https://www.dropbox.com/s/8c87619ewkyod4f/09book_riskBounds.pdf?dl=0 ch09]
|| [https://www.dropbox.com/s/eyfczsuwz60moj7/06sem.pdf?dl=0 list 6]
|| [https://www.dropbox.com/s/1te4fzlwj72v6ph/06sol.pdf?dl=0 solutions 6]
|-
| [https://www.youtube.com/watch?v=yMsUH1brAs8 14 Oct]
|| Bounded differences inequality, Rademacher complexity, symmetrization, contraction lemma, [https://www.dropbox.com/s/8uravgo5shas55g/07quiz.pdf?dl=0 quiz]
|| [https://www.dropbox.com/s/kfithyq0dgcq6h8/07slides.pdf?dl=0 sl07]
|| [https://www.dropbox.com/s/fg4seoqjbeb7a5g/10book_measureConcentration.pdf?dl=0 ch10] [https://www.dropbox.com/s/hfrvhebbsskbk6g/11book_RademacherComplexity.pdf?dl=0 ch11]
|| [https://www.dropbox.com/s/qofutar8qy5y53i/07sem.pdf?dl=0 list 7] update 15.10
|| [https://www.dropbox.com/s/w1ud2okt120vm5j/07sol.pdf?dl=0 solutions 7]
|-
|
|| ''Part 3. Margin risk bounds with applications''
|-
| [https://drive.google.com/file/d/1L-BeDxhoHcoDrdlVTlfoMFwnWXKV46cr/view?usp=sharing 21 Oct]
|| Simple regression, support vector machines, margin risk bounds, and neural nets
|| [https://www.dropbox.com/s/oo1qny9busp3axn/08slides.pdf?dl=0 sl08]
|| [https://www.dropbox.com/s/573a2vtjfx8qqo8/12book_regression.pdf?dl=0 ch12] [https://www.dropbox.com/s/jaym44fmif2uw05/13book_SVM.pdf?dl=0 ch13]
|| [https://www.dropbox.com/s/bzo6msrxcfa8tpp/08sem.pdf?dl=0 list 8]
|| [https://www.dropbox.com/s/pe7yctcr93yaw95/08sol.pdf?dl=0 solutions 8]
|-
| [https://youtu.be/9FhFxLHR4eE 04 Nov]
|| Kernels: RKHS, representer theorem, risk bounds
|| [https://www.dropbox.com/s/jst60ww8ev4ypie/09slides.pdf?dl=0 sl09]
|| [https://www.dropbox.com/s/ply602zthd7r3jv/14book_kernels.pdf?dl=0 ch14]
|| [https://www.dropbox.com/s/54xdufimavhd646/09sem.pdf?dl=0 list 9]
|| [https://www.dropbox.com/s/i3rx26ya6kvm5p2/09sol.pdf?dl=0 solutions 9]
|-
| [https://youtu.be/1oUXZy6Sqlk 11 Nov]
|| AdaBoost and the margin hypothesis
|| [https://www.dropbox.com/s/umum3kd9439dt42/10slides.pdf?dl=0 sl10]
|| [https://www.dropbox.com/s/e7m1cs7e8ulibsf/15book_AdaBoost.pdf?dl=0 ch15]
|| [https://www.dropbox.com/s/nu4a55qbfqlp3bl/10sem.pdf?dl=0 list 10]
|| [https://www.dropbox.com/s/t64mjapdzcm1313/10sol.pdf?dl=0 solutions 10]
|-
| [https://youtu.be/GL574ljefJ8 18 Nov]
|| Implicit regularization of stochastic gradient descent in neural nets
||
|| [https://www.dropbox.com/s/b4xac5uki7l1ysq/16book_implicitRegularization.pdf?dl=0 ch16]
|| no seminar
||
|-
|
|| ''Part 4. Other topics''
|-
| [https://youtu.be/kOXi_m9dBzE 25 Nov]
|| Regression I: fixed design with sub-Gaussian noise
||
|| [https://disk.yandex.ru/i/tI7NiGsvQP0Jww notes12]
|| [https://disk.yandex.ru/d/9fFxVlMw4kPfEQ list 12]
|| [https://disk.yandex.ru/i/5vBE2VC7zNC3Rg solutions 12]
|-
| [https://youtu.be/GEYT_IxXEX0 02 Dec]
|| Multiarmed bandids I
||
|| [https://disk.yandex.ru/i/lvqXofEbaFkfAA notes13]
|| [https://disk.yandex.ru/i/ZXXJbBiJUPNiOw list 13]
||
|-
| [https://youtu.be/Uybf6mCp2Es 09 Dec]
|| Multiarmed bandids II (optional)
||
|| [https://disk.yandex.ru/i/Nqy9-wmZ-g5o8g notes14]
|| [https://disk.yandex.ru/d/0Qupo2CNSjS_pQ notebook], [https://disk.yandex.ru/d/suY6d58SFf09Bg notebook(solved)]
||
|-
| 16 Dec
|| ''Colloquium''
|-
|}

The lectures in October and November are based on the book:
Foundations of machine learning 2nd ed, Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalker, 2018. This book can be downloaded from [https://libgen.is Library Genesis] (the link changes sometimes and sometimes vpn is needed).



== Grading formula ==

Final grade = 0.35 * [score of homeworks] + 0.35 * [score of colloquium] + 0.3 * [score on the exam] + bonus from quizzes.

All homework questions have the same weight. Each solved extra homework task increases the score of the final exam by 1 point.

There is no rounding except on the final grade. Grades fractional grades above 5/10 are rounded up, those below 5/10 are rounded down.

Autogrades: if you only need 4/10 to pass with maximal final score, it will be given automatically. This may happen because of extra questions and bonuses from quizzes.

For students who want to pass with 4/10 with minimal effort: each year on the exam, I ask to calculate the VC-dimension or Rademacher complexity of some class. It should be easy to have 4/10 for the final exam. If you understand all lecture notes, you pass the colloquium with maximal score. Together this is enough. If only a few students fail and the grades are at least 3.8/10 then failed students may resubmit a few homework tasks to pull up the grade. (This happened in the last 3 years.)

== Colloquium ==

[https://www.dropbox.com/s/7djya6nc8ietd32/colloqQuest.pdf?dl=0 Rules and questions.] Update 12/12 added question 24 and corrected typos.



== Homeworks ==

Email to brbauwens-at-gmail.com. Start the subject line with SLT-HW.

Deadline before the start of the lecture, every other lecture.

Sat. 17 Sept 18h10: problems 1.7, 1.8, 2.9, and 2.11 
Sat. 01 Oct 18h10: see lists 3 and 4, and 2.10 
Fri. 14 Oct 16h20: see problem lists 5 and 6 
Sat. 05 Nov 20h00: see problem lists 7 and 8 
Sat. 19 Nov 20h00: see problem lists 9 and 10 
Sun. 04 Dec 23h59: see problem list 12 send it to maxkaledin@gmail.com with subject line SLT-HW-Reg <YourName>_<YourSurname>
 

== Office hours ==

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday !!
|-
| Bruno Bauwens || 15-20h || || || || 18-20h ||
|-
| Maxim Kaledin || Write || in || Telegram || time is || flexible ||
|-
|}

It is always good to send an email in advance. Questions and feedback are welcome.

Statistical learning theory 2022

2022-12-21T06:11:18Z

Bbauwens:

== General Information ==

Lectures: Friday 16h20 -- 17h40, [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], [https://www.hse.ru/staff/mkaledin Maxim Kaledin], room M202 and on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

Seminars: Saturday 14h40 -- 16h00, [https://www.hse.ru/org/persons/225526439 Artur Goldman], room M202 and on zoom (the link will be in telegram)

To discuss the materials, join the [https://t.me/+G0VKOE2-nnkwNDE0 telegram group] The course is similar to [http://wiki.cs.hse.ru/Statistical_learning_theory_2021 last year].

== Colloquium ==

[https://www.dropbox.com/s/7djya6nc8ietd32/colloqQuest.pdf?dl=0 Rules and questions.] Update 12/12 added question 24 and corrected typos.



== Problems exam ==

December 21, 13h-16h, computer room G403 ([https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] for students abroad) 
-- You may use handwritten notes, lecture materials from this wiki (either printed or through your PC), Mohri's book 
-- You may not search on the internet or interact with other humans (e.g. by phone, forums, etc)

== Homeworks ==

Email to brbauwens-at-gmail.com. Start the subject line with SLT-HW.

Deadline before the start of the lecture, every other lecture.

Sat. 17 Sept 18h10: problems 1.7, 1.8, 2.9, and 2.11 
Sat. 01 Oct 18h10: see lists 3 and 4, and 2.10 
Fri. 14 Oct 16h20: see problem lists 5 and 6 
Sat. 05 Nov 20h00: see problem lists 7 and 8 
Sat. 19 Nov 20h00: see problem lists 9 and 10 
Sun. 04 Dec 23h59: see problem list 12 send it to maxkaledin@gmail.com with subject line SLT-HW-Reg <YourName>_<YourSurname>
 

[https://www.dropbox.com/scl/fi/gz6fp21r2c2vvlykcy7vl/grades_dropbox.ods?dl=0&rlkey=ze8jxq139rgvz2t4bi6xlb86w grades]

== Course materials ==

{| class="wikitable"
|-
! Video !! Summary !! Slides !! Lecture notes !! Problem list !! Solutions
|-
|
|| ''Part 1. Online learning''
|-
| 02 Sept
|| Philosophy. The online mistake bound model. The halving and weighted majority algorithms [https://drive.google.com/drive/folders/1NXiLbhmO2Ml7jFmnLtjqhOgCoHg7yn9T?usp=sharing movies]
|| [https://www.dropbox.com/s/ryvpnfqfrwyurjc/01slides.pdf?dl=0 sl01]
|| [https://www.dropbox.com/s/oncvg4mxulbt56d/00book_intro.pdf?dl=0 ch00] [https://www.dropbox.com/s/i9pc4kf0zsdeksb/01book_onlineMistakeBound.pdf?dl=0 ch01]
|| [https://www.dropbox.com/s/ztk3n9s5c0vuzd9/01sem.pdf?dl=0 list 1] update 05.09
|| [https://www.dropbox.com/s/r528uroi60gow08/01sol.pdf?dl=0 solutions 1]
|-
| [https://drive.google.com/file/d/16OoCqhh16BKQzyF-HM8RozigyJ3BBVxA/view?usp=sharing 09 Sept]
|| The perceptron algorithm. The standard optimal algorithm.
|| [https://www.dropbox.com/s/sy959ee81mov5cr/02slides.pdf?dl=0 sl02]
|| [https://www.dropbox.com/s/p3auugqwc89132b/02book_sequentialOptimalAlgorithm.pdf?dl=0 ch02] [https://www.dropbox.com/s/b00dcqk1rob7rdz/03book_perceptron.pdf?dl=0 ch03]
|| [https://www.dropbox.com/s/88jgjvxo16zfrjs/02sem.pdf?dl=0 list 2] update 25.09
|| [https://www.dropbox.com/s/pqblktfky8to5hr/02sol.pdf?dl=0 solutions 2]
|-
| [https://www.youtube.com/watch?v=xgyPvnDkyZs 16 Sept]
|| Kernels and the kernel perceptron algorithm. Prediction with expert advice. Recap probability theory.
|| [https://www.dropbox.com/s/a60p9b76cxusgqy/03slides.pdf?dl=0 sl03]
|| [https://www.dropbox.com/s/3vtxvs4esnvbhlb/04book_predictionWithExperts.pdf?dl=0 ch04] [https://www.dropbox.com/s/l11afq1d0qn6za7/05book_introProbability.pdf?dl=0 ch05]
|| [https://www.dropbox.com/s/fnx2cl5wsgjbmel/03sem.pdf?dl=0 list 3]
|| [https://www.dropbox.com/s/ysg3nipuzryzqoc/03sol.pdf?dl=0 solutions 3]
|-
|
|| ''Part 2. Distribution independent risk bounds''
|-
| [https://www.youtube.com/watch?v=IatjLyN3dRk 23 Sept]
|| Sample complexity in the realizable setting, simple examples and bounds using VC-dimension
|| [https://www.dropbox.com/s/pi0f3wab1xna6d7/04slides.pdf?dl=0 sl04]
|| [https://www.dropbox.com/s/nh4puyv7nst4ems/06book_sampleComplexity.pdf?dl=0 ch06]
|| [https://www.dropbox.com/s/u5dtpm69bu52fpn/04sem.pdf?dl=0 list 4]
|| [https://www.dropbox.com/s/yurv5s42w3kw5vv/04sol.pdf?dl=0 solutions 4]
|-
| [https://www.youtube.com/watch?v=8J5B9CCy-ws 30 Sept]
|| Growth functions, VC-dimension and the characterization of sample comlexity with VC-dimensions
|| [https://www.dropbox.com/s/rpnh6288rdb3j8m/05slides.pdf?dl=0 sl05]
|| [https://www.dropbox.com/s/eurz2vkvt1wa5zm/07book_growthFunctions.pdf?dl=0 ch07] [https://www.dropbox.com/s/m7xe7k39qzmzapv/08book_VCdimension.pdf?dl=0 ch08]
|| [https://www.dropbox.com/s/u1vpi28gwf0zig4/05sem.pdf?dl=0 list 5]
|| [https://www.dropbox.com/s/3sq7yzv7v4l9tbb/05sol.pdf?dl=0 solutions 5]
|-
| [https://drive.google.com/file/d/17zynIg_CZ6cCNBig5QXmBx7VFS8peyuU/view?usp=sharing 07 Oct]
|| Risk decomposition and the fundamental theorem of statistical learning theory
|| [https://www.dropbox.com/s/0p8r5wgjy1hlku2/06slides.pdf?dl=0 sl06]
|| [https://www.dropbox.com/s/8c87619ewkyod4f/09book_riskBounds.pdf?dl=0 ch09]
|| [https://www.dropbox.com/s/eyfczsuwz60moj7/06sem.pdf?dl=0 list 6]
|| [https://www.dropbox.com/s/1te4fzlwj72v6ph/06sol.pdf?dl=0 solutions 6]
|-
| [https://www.youtube.com/watch?v=yMsUH1brAs8 14 Oct]
|| Bounded differences inequality, Rademacher complexity, symmetrization, contraction lemma, [https://www.dropbox.com/s/8uravgo5shas55g/07quiz.pdf?dl=0 quiz]
|| [https://www.dropbox.com/s/kfithyq0dgcq6h8/07slides.pdf?dl=0 sl07]
|| [https://www.dropbox.com/s/fg4seoqjbeb7a5g/10book_measureConcentration.pdf?dl=0 ch10] [https://www.dropbox.com/s/hfrvhebbsskbk6g/11book_RademacherComplexity.pdf?dl=0 ch11]
|| [https://www.dropbox.com/s/qofutar8qy5y53i/07sem.pdf?dl=0 list 7] update 15.10
|| [https://www.dropbox.com/s/w1ud2okt120vm5j/07sol.pdf?dl=0 solutions 7]
|-
|
|| ''Part 3. Margin risk bounds with applications''
|-
| [https://drive.google.com/file/d/1L-BeDxhoHcoDrdlVTlfoMFwnWXKV46cr/view?usp=sharing 21 Oct]
|| Simple regression, support vector machines, margin risk bounds, and neural nets
|| [https://www.dropbox.com/s/oo1qny9busp3axn/08slides.pdf?dl=0 sl08]
|| [https://www.dropbox.com/s/573a2vtjfx8qqo8/12book_regression.pdf?dl=0 ch12] [https://www.dropbox.com/s/jaym44fmif2uw05/13book_SVM.pdf?dl=0 ch13]
|| [https://www.dropbox.com/s/bzo6msrxcfa8tpp/08sem.pdf?dl=0 list 8]
|| [https://www.dropbox.com/s/pe7yctcr93yaw95/08sol.pdf?dl=0 solutions 8]
|-
| [https://youtu.be/9FhFxLHR4eE 04 Nov]
|| Kernels: RKHS, representer theorem, risk bounds
|| [https://www.dropbox.com/s/jst60ww8ev4ypie/09slides.pdf?dl=0 sl09]
|| [https://www.dropbox.com/s/ply602zthd7r3jv/14book_kernels.pdf?dl=0 ch14]
|| [https://www.dropbox.com/s/54xdufimavhd646/09sem.pdf?dl=0 list 9]
|| [https://www.dropbox.com/s/i3rx26ya6kvm5p2/09sol.pdf?dl=0 solutions 9]
|-
| [https://youtu.be/1oUXZy6Sqlk 11 Nov]
|| AdaBoost and the margin hypothesis
|| [https://www.dropbox.com/s/umum3kd9439dt42/10slides.pdf?dl=0 sl10]
|| [https://www.dropbox.com/s/e7m1cs7e8ulibsf/15book_AdaBoost.pdf?dl=0 ch15]
|| [https://www.dropbox.com/s/nu4a55qbfqlp3bl/10sem.pdf?dl=0 list 10]
|| [https://www.dropbox.com/s/t64mjapdzcm1313/10sol.pdf?dl=0 solutions 10]
|-
| [https://youtu.be/GL574ljefJ8 18 Nov]
|| Implicit regularization of stochastic gradient descent in neural nets
||
|| [https://www.dropbox.com/s/b4xac5uki7l1ysq/16book_implicitRegularization.pdf?dl=0 ch16]
|| no seminar
||
|-
|
|| ''Part 4. Other topics''
|-
| [https://youtu.be/kOXi_m9dBzE 25 Nov]
|| Regression I: fixed design with sub-Gaussian noise
||
|| [https://disk.yandex.ru/i/tI7NiGsvQP0Jww notes12]
|| [https://disk.yandex.ru/d/9fFxVlMw4kPfEQ list 12]
|| [https://disk.yandex.ru/i/5vBE2VC7zNC3Rg solutions 12]
|-
| [https://youtu.be/GEYT_IxXEX0 02 Dec]
|| Multiarmed bandids I
||
|| [https://disk.yandex.ru/i/lvqXofEbaFkfAA notes13]
|| [https://disk.yandex.ru/i/ZXXJbBiJUPNiOw list 13]
||
|-
| [https://youtu.be/Uybf6mCp2Es 09 Dec]
|| Multiarmed bandids II (optional)
||
|| [https://disk.yandex.ru/i/Nqy9-wmZ-g5o8g notes14]
|| [https://disk.yandex.ru/d/0Qupo2CNSjS_pQ notebook], [https://disk.yandex.ru/d/suY6d58SFf09Bg notebook(solved)]
||
|-
| 16 Dec
|| ''Colloquium''
|-
|}

The lectures in October and November are based on the book:
Foundations of machine learning 2nd ed, Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalker, 2018. This book can be downloaded from [https://libgen.is Library Genesis] (the link changes sometimes and sometimes vpn is needed).



== Grading formula ==

Final grade = 0.35 * [score of homeworks] + 0.35 * [score of colloquium] + 0.3 * [score on the exam] + bonus from quizzes.

All homework questions have the same weight. Each solved extra homework task increases the score of the final exam by 1 point.

There is no rounding except on the final grade. Grades fractional grades above 5/10 are rounded up, those below 5/10 are rounded down.

Autogrades: if you only need 4/10 to pass with maximal final score, it will be given automatically. This may happen because of extra questions and bonuses from quizzes.

For students who want to pass with 4/10 with minimal effort: each year on the exam, I ask to calculate the VC-dimension or Rademacher complexity of some class. It should be easy to have 4/10 for the final exam. If you understand all lecture notes, you pass the colloquium with maximal score. Together this is enough. If only a few students fail and the grades are at least 3.8/10 then failed students may resubmit a few homework tasks to pull up the grade. (This happened in the last 3 years.)

== Office hours ==

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday !!
|-
| Bruno Bauwens || 15-20h || || || || 18-20h ||
|-
| Maxim Kaledin || Write || in || Telegram || time is || flexible ||
|-
|}

It is always good to send an email in advance. Questions and feedback are welcome.

Statistical learning theory 2022

2022-12-21T06:10:35Z

Bbauwens:

== General Information ==

Lectures: Friday 16h20 -- 17h40, [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], [https://www.hse.ru/staff/mkaledin Maxim Kaledin], room M202 and on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]

Seminars: Saturday 14h40 -- 16h00, [https://www.hse.ru/org/persons/225526439 Artur Goldman], room M202 and on zoom (the link will be in telegram)

To discuss the materials, join the [https://t.me/+G0VKOE2-nnkwNDE0 telegram group] The course is similar to [http://wiki.cs.hse.ru/Statistical_learning_theory_2021 last year].

== Colloquium ==

[https://www.dropbox.com/s/7djya6nc8ietd32/colloqQuest.pdf?dl=0 Rules and questions.] Update 12/12 added question 24 and corrected typos.

[https://docs.google.com/spreadsheets/d/13ox_EN6YJBEC93A6YgbbzawXE2RfynyQTUf90SXE4GQ/edit?usp=sharing Choose the day: 16 or 17 Dec.]

== Problems exam ==

December 21, 13h-16h, computer room G403 ([https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] for students abroad) 
-- You may use handwritten notes, lecture materials from this wiki (either printed or through your PC), Mohri's book 
-- You may not search on the internet or interact with other humans (e.g. by phone, forums, etc)

== Homeworks ==

Email to brbauwens-at-gmail.com. Start the subject line with SLT-HW.

Deadline before the start of the lecture, every other lecture.

Sat. 17 Sept 18h10: problems 1.7, 1.8, 2.9, and 2.11 
Sat. 01 Oct 18h10: see lists 3 and 4, and 2.10 
Fri. 14 Oct 16h20: see problem lists 5 and 6 
Sat. 05 Nov 20h00: see problem lists 7 and 8 
Sat. 19 Nov 20h00: see problem lists 9 and 10 
Sun. 04 Dec 23h59: see problem list 12 send it to maxkaledin@gmail.com with subject line SLT-HW-Reg <YourName>_<YourSurname>
 

[https://www.dropbox.com/scl/fi/gz6fp21r2c2vvlykcy7vl/grades_dropbox.ods?dl=0&rlkey=ze8jxq139rgvz2t4bi6xlb86w grades]

== Course materials ==

{| class="wikitable"
|-
! Video !! Summary !! Slides !! Lecture notes !! Problem list !! Solutions
|-
|
|| ''Part 1. Online learning''
|-
| 02 Sept
|| Philosophy. The online mistake bound model. The halving and weighted majority algorithms [https://drive.google.com/drive/folders/1NXiLbhmO2Ml7jFmnLtjqhOgCoHg7yn9T?usp=sharing movies]
|| [https://www.dropbox.com/s/ryvpnfqfrwyurjc/01slides.pdf?dl=0 sl01]
|| [https://www.dropbox.com/s/oncvg4mxulbt56d/00book_intro.pdf?dl=0 ch00] [https://www.dropbox.com/s/i9pc4kf0zsdeksb/01book_onlineMistakeBound.pdf?dl=0 ch01]
|| [https://www.dropbox.com/s/ztk3n9s5c0vuzd9/01sem.pdf?dl=0 list 1] update 05.09
|| [https://www.dropbox.com/s/r528uroi60gow08/01sol.pdf?dl=0 solutions 1]
|-
| [https://drive.google.com/file/d/16OoCqhh16BKQzyF-HM8RozigyJ3BBVxA/view?usp=sharing 09 Sept]
|| The perceptron algorithm. The standard optimal algorithm.
|| [https://www.dropbox.com/s/sy959ee81mov5cr/02slides.pdf?dl=0 sl02]
|| [https://www.dropbox.com/s/p3auugqwc89132b/02book_sequentialOptimalAlgorithm.pdf?dl=0 ch02] [https://www.dropbox.com/s/b00dcqk1rob7rdz/03book_perceptron.pdf?dl=0 ch03]
|| [https://www.dropbox.com/s/88jgjvxo16zfrjs/02sem.pdf?dl=0 list 2] update 25.09
|| [https://www.dropbox.com/s/pqblktfky8to5hr/02sol.pdf?dl=0 solutions 2]
|-
| [https://www.youtube.com/watch?v=xgyPvnDkyZs 16 Sept]
|| Kernels and the kernel perceptron algorithm. Prediction with expert advice. Recap probability theory.
|| [https://www.dropbox.com/s/a60p9b76cxusgqy/03slides.pdf?dl=0 sl03]
|| [https://www.dropbox.com/s/3vtxvs4esnvbhlb/04book_predictionWithExperts.pdf?dl=0 ch04] [https://www.dropbox.com/s/l11afq1d0qn6za7/05book_introProbability.pdf?dl=0 ch05]
|| [https://www.dropbox.com/s/fnx2cl5wsgjbmel/03sem.pdf?dl=0 list 3]
|| [https://www.dropbox.com/s/ysg3nipuzryzqoc/03sol.pdf?dl=0 solutions 3]
|-
|
|| ''Part 2. Distribution independent risk bounds''
|-
| [https://www.youtube.com/watch?v=IatjLyN3dRk 23 Sept]
|| Sample complexity in the realizable setting, simple examples and bounds using VC-dimension
|| [https://www.dropbox.com/s/pi0f3wab1xna6d7/04slides.pdf?dl=0 sl04]
|| [https://www.dropbox.com/s/nh4puyv7nst4ems/06book_sampleComplexity.pdf?dl=0 ch06]
|| [https://www.dropbox.com/s/u5dtpm69bu52fpn/04sem.pdf?dl=0 list 4]
|| [https://www.dropbox.com/s/yurv5s42w3kw5vv/04sol.pdf?dl=0 solutions 4]
|-
| [https://www.youtube.com/watch?v=8J5B9CCy-ws 30 Sept]
|| Growth functions, VC-dimension and the characterization of sample comlexity with VC-dimensions
|| [https://www.dropbox.com/s/rpnh6288rdb3j8m/05slides.pdf?dl=0 sl05]
|| [https://www.dropbox.com/s/eurz2vkvt1wa5zm/07book_growthFunctions.pdf?dl=0 ch07] [https://www.dropbox.com/s/m7xe7k39qzmzapv/08book_VCdimension.pdf?dl=0 ch08]
|| [https://www.dropbox.com/s/u1vpi28gwf0zig4/05sem.pdf?dl=0 list 5]
|| [https://www.dropbox.com/s/3sq7yzv7v4l9tbb/05sol.pdf?dl=0 solutions 5]
|-
| [https://drive.google.com/file/d/17zynIg_CZ6cCNBig5QXmBx7VFS8peyuU/view?usp=sharing 07 Oct]
|| Risk decomposition and the fundamental theorem of statistical learning theory
|| [https://www.dropbox.com/s/0p8r5wgjy1hlku2/06slides.pdf?dl=0 sl06]
|| [https://www.dropbox.com/s/8c87619ewkyod4f/09book_riskBounds.pdf?dl=0 ch09]
|| [https://www.dropbox.com/s/eyfczsuwz60moj7/06sem.pdf?dl=0 list 6]
|| [https://www.dropbox.com/s/1te4fzlwj72v6ph/06sol.pdf?dl=0 solutions 6]
|-
| [https://www.youtube.com/watch?v=yMsUH1brAs8 14 Oct]
|| Bounded differences inequality, Rademacher complexity, symmetrization, contraction lemma, [https://www.dropbox.com/s/8uravgo5shas55g/07quiz.pdf?dl=0 quiz]
|| [https://www.dropbox.com/s/kfithyq0dgcq6h8/07slides.pdf?dl=0 sl07]
|| [https://www.dropbox.com/s/fg4seoqjbeb7a5g/10book_measureConcentration.pdf?dl=0 ch10] [https://www.dropbox.com/s/hfrvhebbsskbk6g/11book_RademacherComplexity.pdf?dl=0 ch11]
|| [https://www.dropbox.com/s/qofutar8qy5y53i/07sem.pdf?dl=0 list 7] update 15.10
|| [https://www.dropbox.com/s/w1ud2okt120vm5j/07sol.pdf?dl=0 solutions 7]
|-
|
|| ''Part 3. Margin risk bounds with applications''
|-
| [https://drive.google.com/file/d/1L-BeDxhoHcoDrdlVTlfoMFwnWXKV46cr/view?usp=sharing 21 Oct]
|| Simple regression, support vector machines, margin risk bounds, and neural nets
|| [https://www.dropbox.com/s/oo1qny9busp3axn/08slides.pdf?dl=0 sl08]
|| [https://www.dropbox.com/s/573a2vtjfx8qqo8/12book_regression.pdf?dl=0 ch12] [https://www.dropbox.com/s/jaym44fmif2uw05/13book_SVM.pdf?dl=0 ch13]
|| [https://www.dropbox.com/s/bzo6msrxcfa8tpp/08sem.pdf?dl=0 list 8]
|| [https://www.dropbox.com/s/pe7yctcr93yaw95/08sol.pdf?dl=0 solutions 8]
|-
| [https://youtu.be/9FhFxLHR4eE 04 Nov]
|| Kernels: RKHS, representer theorem, risk bounds
|| [https://www.dropbox.com/s/jst60ww8ev4ypie/09slides.pdf?dl=0 sl09]
|| [https://www.dropbox.com/s/ply602zthd7r3jv/14book_kernels.pdf?dl=0 ch14]
|| [https://www.dropbox.com/s/54xdufimavhd646/09sem.pdf?dl=0 list 9]
|| [https://www.dropbox.com/s/i3rx26ya6kvm5p2/09sol.pdf?dl=0 solutions 9]
|-
| [https://youtu.be/1oUXZy6Sqlk 11 Nov]
|| AdaBoost and the margin hypothesis
|| [https://www.dropbox.com/s/umum3kd9439dt42/10slides.pdf?dl=0 sl10]
|| [https://www.dropbox.com/s/e7m1cs7e8ulibsf/15book_AdaBoost.pdf?dl=0 ch15]
|| [https://www.dropbox.com/s/nu4a55qbfqlp3bl/10sem.pdf?dl=0 list 10]
|| [https://www.dropbox.com/s/t64mjapdzcm1313/10sol.pdf?dl=0 solutions 10]
|-
| [https://youtu.be/GL574ljefJ8 18 Nov]
|| Implicit regularization of stochastic gradient descent in neural nets
||
|| [https://www.dropbox.com/s/b4xac5uki7l1ysq/16book_implicitRegularization.pdf?dl=0 ch16]
|| no seminar
||
|-
|
|| ''Part 4. Other topics''
|-
| [https://youtu.be/kOXi_m9dBzE 25 Nov]
|| Regression I: fixed design with sub-Gaussian noise
||
|| [https://disk.yandex.ru/i/tI7NiGsvQP0Jww notes12]
|| [https://disk.yandex.ru/d/9fFxVlMw4kPfEQ list 12]
|| [https://disk.yandex.ru/i/5vBE2VC7zNC3Rg solutions 12]
|-
| [https://youtu.be/GEYT_IxXEX0 02 Dec]
|| Multiarmed bandids I
||
|| [https://disk.yandex.ru/i/lvqXofEbaFkfAA notes13]
|| [https://disk.yandex.ru/i/ZXXJbBiJUPNiOw list 13]
||
|-
| [https://youtu.be/Uybf6mCp2Es 09 Dec]
|| Multiarmed bandids II (optional)
||
|| [https://disk.yandex.ru/i/Nqy9-wmZ-g5o8g notes14]
|| [https://disk.yandex.ru/d/0Qupo2CNSjS_pQ notebook], [https://disk.yandex.ru/d/suY6d58SFf09Bg notebook(solved)]
||
|-
| 16 Dec
|| ''Colloquium''
|-
|}

The lectures in October and November are based on the book:
Foundations of machine learning 2nd ed, Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalker, 2018. This book can be downloaded from [https://libgen.is Library Genesis] (the link changes sometimes and sometimes vpn is needed).



== Grading formula ==

Final grade = 0.35 * [score of homeworks] + 0.35 * [score of colloquium] + 0.3 * [score on the exam] + bonus from quizzes.

All homework questions have the same weight. Each solved extra homework task increases the score of the final exam by 1 point.

There is no rounding except on the final grade. Grades fractional grades above 5/10 are rounded up, those below 5/10 are rounded down.

Autogrades: if you only need 4/10 to pass with maximal final score, it will be given automatically. This may happen because of extra questions and bonuses from quizzes.

For students who want to pass with 4/10 with minimal effort: each year on the exam, I ask to calculate the VC-dimension or Rademacher complexity of some class. It should be easy to have 4/10 for the final exam. If you understand all lecture notes, you pass the colloquium with maximal score. Together this is enough. If only a few students fail and the grades are at least 3.8/10 then failed students may resubmit a few homework tasks to pull up the grade. (This happened in the last 3 years.)

== Office hours ==

{| class="wikitable"
|-
! Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday !!
|-
| Bruno Bauwens || 15-20h || || || || 18-20h ||
|-
| Maxim Kaledin || Write || in || Telegram || time is || flexible ||
|-
|}

It is always good to send an email in advance. Questions and feedback are welcome.

Theory of Computation 2022

2022-12-19T15:09:25Z

Bbauwens:

= Exam =

Date: Tuesday December 20th, 13h-16h, D501

If you are happy with your current score and do not plan to attend the exam, you need to send an email to brbauwens-at-gmail.com to confirm this before the exam. (For complex administrative reasons.)

The exam consists out of 8 exercises that you must solve in 3 hours time.

There will be copies of Sipser's book available (as well as Arora and Barak and Mertens and Moore). You may bring your own copy if you have it, as well as handwritten notes.

Students abroad are allowed to do the exam online using this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink]

= Classes =

Lectures: Monday 13:00 - 14:20 in Pokrovkaya and on this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] by [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/191486005 Alexey Talambutsa]

Seminars: Monday 14:40 - 16:00 in Pokrovkaya and on [https://us06web.zoom.us/j/82302406358?pwd=OFMyS2E4SVZaWFZaeXFsWHRFMWROZz09 zoomlink] by [https://www.hse.ru/en/org/persons/208499388 Pavel Zakharov]

= Dates and Deadlines =

Homeworks 1, 2, 3: <s>September 26</s> '''October 3''' (update of 2.7 and 3.7 on 26/09)

Homeworks 4, 5: October 10

Homeworks 6, 7, 8: November 7

Homeworks 9, 10, 11: November 28 (update of 11.6 and 11.7 on 21/11, 9.9 on 23.11)

Submit homework in google classroom in this [https://classroom.google.com/c/NTQ5OTYyMzk3ODc0?cjc=27kcgjp link], code: 27kcgjp You should upload either scanned handwriting or pdf file into the corresponding section.

Table with [https://docs.google.com/spreadsheets/d/1J_mJJlr52xKDAGXF_4Rr-qdsW-q3p4XPzJVE-WDrxsk/edit?usp=sharing grades]


= Course Materials =

The main reference is Sipser's book "Introduction to the theory of computation", chapters 3, 4, 7–10.

For students abroad: the first 5 lectures are covered in chapters 3, 4, 7 and 9.1. Other lectures will be recorded. See also recordings of [http://wiki.cs.hse.ru/Theory_of_Computation_2021 previous year].

If you need some background in math, consider these two sources: 
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi 
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

{| class="wikitable"
|-
! !! Summary !! Problem list
|-
|| 05.09 || Turing machines, multitape Turing machines, connection between them. Universal Turing machine. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. || [https://www.dropbox.com/s/9n9ihiti0yufvc8/prob_1.pdf?dl=0 Problem set 1]
|-
|| 12.09 || Time and space hierarchy theorems. Time and space constructible functions. || [https://www.dropbox.com/s/jqz33aqwfl992tc/prob_2.pdf?dl=0 Problem set 2] update 26.09
|-
|| 19.09 || Because of various problems, the materials of last 2 weeks were repeated. || [https://www.dropbox.com/s/05iiwsdpggfjuul/prob_3.pdf?dl=0 Problem set 3] update 25.09
|-
|| 26.09 || Complexity class NP. Examples. Polynomial reductions. NP-hardness and NP-completeness. || [https://www.dropbox.com/s/454bok6rvsdtfix/prob_4.pdf?dl=0 Problem set 4]
|-
|| 3.10 || Non-deterministic TMs. Another definition of NP. Proving NP-hardness by reduction from an NP-complete problem. Examples of NP-complete problems. HAMPATH is NP-complete || [https://www.dropbox.com/s/y4ktp5e2tjryqwr/prob_5.pdf?dl=0 Problem set 5]
|-
|| 10.10 || Circuit complexity. Classes AC^i, NC^i, P/poly. All functions are computed by circuits. Existence of functions with exponential circuit complexity. NC1 = Boolean formulas of polynomial size. P is in P/poly. Addition in AC0. Multiplication is in NC1. [https://www.dropbox.com/s/0qnyl552qvplc0e/Acirctuis.pdf?dl=0 circuit_notes.pdf] || [https://www.dropbox.com/s/z54tjl4a5rswmhd/prob_6.pdf?dl=0 Problem set 6]
|-
|| 17.10 || Classes L, NL, PSPACE and NPSPACE. Inclusions between P, NP, and PSPACE. Cook–Levin theorem, NP-completeness of: subsetsum, set-splitting, 3-colorability and exactly 1-in-3 SAT. || [https://www.dropbox.com/s/y8rv53yz2he58uf/prob_7.pdf?dl=0 Problem set 7]
|-
|| 31.10 || Directed Reachability is in SPACE(log^2 n). TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) for space constructible s. PSPACE completeness of generalized geography. || [https://www.dropbox.com/s/d8svos0sn0d53ys/prob_08.pdf?dl=0 Problem set 8]
|-
||07.11 || Oracle computation definitions. There exists an oracle ''A'' for which P''A'' = NP''A''. There is an oracle B such that P''B'' is not equal to NP''B''. || [https://www.dropbox.com/s/qym967max8yxhsn/prob_9.pdf?dl=0 Problem set 9]update 23.11
|-
|| 14.11 || Probabilistic computation. Probabilistic machines, the class BPP, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Most of it is also [https://www.youtube.com/watch?v=YSMgVbOqB-8&list=PLm3J0oaFux3YL5vLXpzOyJiLtqLp6dCW2&index=23 here]|| [https://www.dropbox.com/s/zg1f51ryxliz2s9/prob_10.pdf?dl=0 Problem set 10]
|-
|| 21.11 || Streaming algorithms: finding the majority element, computation of the number of different elements  in logarithmic space. See Chapts 6.1-6.2 in [https://home.ttic.edu/~avrim/book.pdf foundations of datascience] by Avrim Blum and others. Another nice chapter in [http://theory.stanford.edu/~tim/w15/l/l1.pdf Tim Roughgarden's lecture notes] || [https://www.dropbox.com/s/r3zzgjyw07ltz2b/prob_11.pdf?dl=0 Problem set 11] update 21.11
|-
|| 28.11 || More streaming algorithms: calculation F_0 moments, Hash functions, finding the frequent items in streams of data: SpaceSaving. || [https://www.dropbox.com/s/he8ws0ldovhenhh/prob_12.pdf?dl=0 Problem set 12]
|-
|| 05.12 || Colloquium. ||
|-
|| 12.12 || Approximation algorithms and complexity of clustering [https://www.dropbox.com/s/wvtcsl6crkj8zeq/tc-12-approximation.pdf?dl=0 Slides.]
|| [https://www.dropbox.com/s/37gdsbv2it8omnm/tc-sample-exam.pdf?dl=0 Sample exam]
|}

For interested students: parameterized complexity. We review topics from chapters 1, 2, 3, 13 in "Parameterized algorithms" by Cygan, Fomin and others, 2016.

19 Sept: Fixed parameter tracktability and examples. Kernels. [https://www.dropbox.com/s/zzzaulpmzql7x7u/parameterizedComplexity.pdf?dl=0 presentation].

26 Sept: feedback vertex set, linear programming kernel for vertex cover, k-path problem, exercises on chapters 2 and 3.

3 Oct: Lower bounds using the exponential time hypothesis. [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] from a nice [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms course]

= Project (for PI students) =

During the 3rd module Januari till March 2023. The task is to understand a theoretical paper better by either

(Th) Rewrite some mathematical proof of a research paper in a more accessible way using your own words. You also need to give a lecture (you are not allowed to look at the paper during the lecture). I need to work out examples. Possibly examples that I give you on the spot.

(Imp) Implement an algorithm (or parts of an algorithm) from a research paper and demonstrate that it works.

Here are examples of each type concerning the vertex cover problem:

(Th) prove lemma 4.1 of the paper https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.127 , you need to study some parameterized complexity, see below the table with course materials for references.

(Th) prove theorem 5 from https://www.researchgate.net/profile/Lars-Jaffke/publication/329181540_What_is_known_about_Vertex_Cover_Kernelization/links/5cb319df92851c8d22ea17b6/What-is-known-about-Vertex-Cover-Kernelization.pdf

(Imp) implement a kernel and a simple branch and bound variant from https://arxiv.org/pdf/1908.06795.pdf, as well as compare your algorithm with the results in the contest https://pacechallenge.org/2019/vc/vc_exact/

You can propose projects yourself, but it is not allowed to have a theoretical paper about software verification. (Because there are too many definitions, and during the lecture it usually turns out the student does not understand them.)

= Additional reading =

Both books contain a lot of extra materials and describe more recent discoveries in computational complexity. The first book has a gentel and pleasant style. The second book is a rigurous textbook for students theoretical computer science at the beginning master level.

C. Moore and S. Mertens, The nature of computation, 2011.

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

= Grading =

For AMI students:

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] 

For PI students (the course is called "computational complexity" and takes 3 modules):

Final score = 0.25 * [score homework] + 0.25 * [score colloquium] + 0.25 * [score exam] + 0.25 * [score project] 

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra point on the final exam. There will be around 6 extra problems.

= Colloquium =

December 5, 13h00 -- 16h00, room D206 (room D102 after 14h40)

[https://www.dropbox.com/s/sk6df3zl4sxehwz/col.pdf?dl=0 rules and questions] (updated 25.11)

= Office hours =

Bruno Bauwens: Mondays 14h30-20h. Fridays 18h-20h. You can warn in advance by emailing to brbauwens -a- gmail.com

Alexey Talambutsa: First contact by email.

Theory of Computation 2022

2022-12-18T17:20:36Z

Bbauwens:

Table with [https://docs.google.com/spreadsheets/d/1J_mJJlr52xKDAGXF_4Rr-qdsW-q3p4XPzJVE-WDrxsk/edit?usp=sharing grades]

= Exam =

Date: Tuesday December 20th, 13h-16h, D501

If you are happy with your current score and do not plan to attend the exam, you need to send an email to brbauwens-at-gmail.com to confirm this before the exam. (For complex administrative reasons.)

The exam consists out of 8 exercises that you must solve in 3 hours time.

There will be copies of Sipser's book available (as well as Arora and Barak and Mertens and Moore). You may bring your own copy if you have it, as well as handwritten notes.

Students abroad are allowed to do the exam online using this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink]

= Classes =

Lectures: Monday 13:00 - 14:20 in Pokrovkaya and on this [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoomlink] by [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] and [https://www.hse.ru/en/org/persons/191486005 Alexey Talambutsa]

Seminars: Monday 14:40 - 16:00 in Pokrovkaya and on [https://us06web.zoom.us/j/82302406358?pwd=OFMyS2E4SVZaWFZaeXFsWHRFMWROZz09 zoomlink] by [https://www.hse.ru/en/org/persons/208499388 Pavel Zakharov]

= Dates and Deadlines =

Homeworks 1, 2, 3: <s>September 26</s> '''October 3''' (update of 2.7 and 3.7 on 26/09)

Homeworks 4, 5: October 10

Homeworks 6, 7, 8: November 7

Homeworks 9, 10, 11: November 28 (update of 11.6 and 11.7 on 21/11, 9.9 on 23.11)

Submit homework in google classroom in this [https://classroom.google.com/c/NTQ5OTYyMzk3ODc0?cjc=27kcgjp link], code: 27kcgjp You should upload either scanned handwriting or pdf file into the corresponding section.

Table with your grades: [https://docs.google.com/spreadsheets/d/126woxFOYUr2uD2FN3BEi2ACWIaJcu2TAsQTvHkRBl-s/edit?usp=sharing link].

= Course Materials =

The main reference is Sipser's book "Introduction to the theory of computation", chapters 3, 4, 7–10.

For students abroad: the first 5 lectures are covered in chapters 3, 4, 7 and 9.1. Other lectures will be recorded. See also recordings of [http://wiki.cs.hse.ru/Theory_of_Computation_2021 previous year].

If you need some background in math, consider these two sources: 
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi 
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)

{| class="wikitable"
|-
! !! Summary !! Problem list
|-
|| 05.09 || Turing machines, multitape Turing machines, connection between them. Universal Turing machine. Examples. Time and space complexity. Complexity classes P, PSPACE, EXP. || [https://www.dropbox.com/s/9n9ihiti0yufvc8/prob_1.pdf?dl=0 Problem set 1]
|-
|| 12.09 || Time and space hierarchy theorems. Time and space constructible functions. || [https://www.dropbox.com/s/jqz33aqwfl992tc/prob_2.pdf?dl=0 Problem set 2] update 26.09
|-
|| 19.09 || Because of various problems, the materials of last 2 weeks were repeated. || [https://www.dropbox.com/s/05iiwsdpggfjuul/prob_3.pdf?dl=0 Problem set 3] update 25.09
|-
|| 26.09 || Complexity class NP. Examples. Polynomial reductions. NP-hardness and NP-completeness. || [https://www.dropbox.com/s/454bok6rvsdtfix/prob_4.pdf?dl=0 Problem set 4]
|-
|| 3.10 || Non-deterministic TMs. Another definition of NP. Proving NP-hardness by reduction from an NP-complete problem. Examples of NP-complete problems. HAMPATH is NP-complete || [https://www.dropbox.com/s/y4ktp5e2tjryqwr/prob_5.pdf?dl=0 Problem set 5]
|-
|| 10.10 || Circuit complexity. Classes AC^i, NC^i, P/poly. All functions are computed by circuits. Existence of functions with exponential circuit complexity. NC1 = Boolean formulas of polynomial size. P is in P/poly. Addition in AC0. Multiplication is in NC1. [https://www.dropbox.com/s/0qnyl552qvplc0e/Acirctuis.pdf?dl=0 circuit_notes.pdf] || [https://www.dropbox.com/s/z54tjl4a5rswmhd/prob_6.pdf?dl=0 Problem set 6]
|-
|| 17.10 || Classes L, NL, PSPACE and NPSPACE. Inclusions between P, NP, and PSPACE. Cook–Levin theorem, NP-completeness of: subsetsum, set-splitting, 3-colorability and exactly 1-in-3 SAT. || [https://www.dropbox.com/s/y8rv53yz2he58uf/prob_7.pdf?dl=0 Problem set 7]
|-
|| 31.10 || Directed Reachability is in SPACE(log^2 n). TQBF problem, its PSPACE-completeness. PSPACE = NPSPACE. NSPACE(s(n)) is in SPACE(s(n)^2) for space constructible s. PSPACE completeness of generalized geography. || [https://www.dropbox.com/s/d8svos0sn0d53ys/prob_08.pdf?dl=0 Problem set 8]
|-
||07.11 || Oracle computation definitions. There exists an oracle ''A'' for which P''A'' = NP''A''. There is an oracle B such that P''B'' is not equal to NP''B''. || [https://www.dropbox.com/s/qym967max8yxhsn/prob_9.pdf?dl=0 Problem set 9]update 23.11
|-
|| 14.11 || Probabilistic computation. Probabilistic machines, the class BPP, invariance of the definition BPP for different thresholds, RP, coRP, PP, ZPP. BPP is in P/poly. Most of it is also [https://www.youtube.com/watch?v=YSMgVbOqB-8&list=PLm3J0oaFux3YL5vLXpzOyJiLtqLp6dCW2&index=23 here]|| [https://www.dropbox.com/s/zg1f51ryxliz2s9/prob_10.pdf?dl=0 Problem set 10]
|-
|| 21.11 || Streaming algorithms: finding the majority element, computation of the number of different elements  in logarithmic space. See Chapts 6.1-6.2 in [https://home.ttic.edu/~avrim/book.pdf foundations of datascience] by Avrim Blum and others. Another nice chapter in [http://theory.stanford.edu/~tim/w15/l/l1.pdf Tim Roughgarden's lecture notes] || [https://www.dropbox.com/s/r3zzgjyw07ltz2b/prob_11.pdf?dl=0 Problem set 11] update 21.11
|-
|| 28.11 || More streaming algorithms: calculation F_0 moments, Hash functions, finding the frequent items in streams of data: SpaceSaving. || [https://www.dropbox.com/s/he8ws0ldovhenhh/prob_12.pdf?dl=0 Problem set 12]
|-
|| 05.12 || Colloquium. ||
|-
|| 12.12 || Approximation algorithms and complexity of clustering [https://www.dropbox.com/s/wvtcsl6crkj8zeq/tc-12-approximation.pdf?dl=0 Slides.]
|| [https://www.dropbox.com/s/37gdsbv2it8omnm/tc-sample-exam.pdf?dl=0 Sample exam]
|}

For interested students: parameterized complexity. We review topics from chapters 1, 2, 3, 13 in "Parameterized algorithms" by Cygan, Fomin and others, 2016.

19 Sept: Fixed parameter tracktability and examples. Kernels. [https://www.dropbox.com/s/zzzaulpmzql7x7u/parameterizedComplexity.pdf?dl=0 presentation].

26 Sept: feedback vertex set, linear programming kernel for vertex cover, k-path problem, exercises on chapters 2 and 3.

3 Oct: Lower bounds using the exponential time hypothesis. [https://www.mpi-inf.mpg.de/fileadmin/inf/d1/teaching/summer20/paraalg/Lectures/lecture_3.pdf slides] from a nice [https://www.mpi-inf.mpg.de/departments/algorithms-complexity/teaching/summer20/parameterized-algorithms course]

= Project (for PI students) =

During the 3rd module Januari till March 2023. The task is to understand a theoretical paper better by either

(Th) Rewrite some mathematical proof of a research paper in a more accessible way using your own words. You also need to give a lecture (you are not allowed to look at the paper during the lecture). I need to work out examples. Possibly examples that I give you on the spot.

(Imp) Implement an algorithm (or parts of an algorithm) from a research paper and demonstrate that it works.

Here are examples of each type concerning the vertex cover problem:

(Th) prove lemma 4.1 of the paper https://epubs.siam.org/doi/pdf/10.1137/1.9781611973402.127 , you need to study some parameterized complexity, see below the table with course materials for references.

(Th) prove theorem 5 from https://www.researchgate.net/profile/Lars-Jaffke/publication/329181540_What_is_known_about_Vertex_Cover_Kernelization/links/5cb319df92851c8d22ea17b6/What-is-known-about-Vertex-Cover-Kernelization.pdf

(Imp) implement a kernel and a simple branch and bound variant from https://arxiv.org/pdf/1908.06795.pdf, as well as compare your algorithm with the results in the contest https://pacechallenge.org/2019/vc/vc_exact/

You can propose projects yourself, but it is not allowed to have a theoretical paper about software verification. (Because there are too many definitions, and during the lecture it usually turns out the student does not understand them.)

= Additional reading =

Both books contain a lot of extra materials and describe more recent discoveries in computational complexity. The first book has a gentel and pleasant style. The second book is a rigurous textbook for students theoretical computer science at the beginning master level.

C. Moore and S. Mertens, The nature of computation, 2011.

S. Arora and B. Barak, Computational Complexity: A Modern Approach, 2009.

= Grading =

For AMI students:

Final score = 0.35 * [score homework] + 0.35 * [score colloquium] + 0.3 * [score exam] 

For PI students (the course is called "computational complexity" and takes 3 modules):

Final score = 0.25 * [score homework] + 0.25 * [score colloquium] + 0.25 * [score exam] + 0.25 * [score project] 

Some homework assignments contain extra problems. Each solution of an extra problem will give 1 extra point on the final exam. There will be around 6 extra problems.

= Colloquium =

December 5, 13h00 -- 16h00, room D206 (room D102 after 14h40)

[https://www.dropbox.com/s/sk6df3zl4sxehwz/col.pdf?dl=0 rules and questions] (updated 25.11)

= Office hours =

Bruno Bauwens: Mondays 14h30-20h. Fridays 18h-20h. You can warn in advance by emailing to brbauwens -a- gmail.com

Alexey Talambutsa: First contact by email.