Theoretical Computer Science 2022 — различия между версиями
Bbauwens (обсуждение | вклад) |
Bbauwens (обсуждение | вклад) |
||
(не показано 58 промежуточных версии 3 участников) | |||
Строка 1: | Строка 1: | ||
− | |||
= Classes = | = Classes = | ||
Строка 6: | Строка 5: | ||
Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens] | 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 = | = Course Materials = | ||
− | |||
<!-- If you need some background in math, consider these two sources:<br> | <!-- If you need some background in math, consider these two sources:<br> | ||
Строка 23: | Строка 16: | ||
{| class="wikitable" | {| class="wikitable" | ||
|- | |- | ||
− | ! Video !! Summary !! Notes | + | ! 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] | + | || [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 | + | || 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] |
|- | |- | ||
− | || | + | || <span style="color:gray">23.02</span> || <span style="color:gray">Holliday</span> || |
|- | |- | ||
− | || | + | || 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] | ||
+ | |- | ||
+ | || <span style="color:gray">20.04</span> || <span style="color:gray">No lecture</span> | ||
+ | |- | ||
+ | || 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%<br> | ||
+ | |||
+ | 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. | ||
+ | <!-- Strunk and White, [https://www.dropbox.com/s/7e6fcdpx3nubvko/strunk-white-1979-elements-of-style.pdf?dl=0 The elements of style], 1979.--> | ||
+ | |||
= Office hours = | = Office hours = | ||
Строка 52: | Строка 105: | ||
| [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] || || || || || 14:00-20:00 | | [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. |
Текущая версия на 21:11, 9 февраля 2023
Classes
Wednesdays 18:10–21:00, on zoom
Teacher: Bruno Bauwens
For practical information join the telegram group
Course Materials
Video | Summary | Notes ! |
---|---|---|
19.01 | Regular languages: (non)deterministic automata and their equivalence, pumping lemma, closure properties | lecture 1 |
25.01 | Turing machines and register machines | lecture 2 |
09.02 | undecidability of: Halting program, Wang tiling, Fractran Godel's incompleteness theorems | lecture 3.A 3.B |
16.02 | The classes P, EXP, PSPACE, EXPSPACE. Dynamic programming. Time and space hierarchy theorems. | seminar |
23.02 | Holliday | |
02.03 | The class NP and NP-completeness | notes |
02.03 | Circuits, proof of the Levin-Cook theorem (see also Mertens&Moore chapter 5), more reductions | circuits |
16.03 | More NP-complete problems | reductions |
23.03 | Games, PSPACE, Savich theorem, completeness of TQBF | pspace |
30.03 | Parameterized complexity I: the class FPT and kernelization | notes |
13.04 | Parameterized complexity II: the W-hierarchy | slides (by Daniel Max) exercises |
20.04 | No lecture | |
27.04 | Projects |
Homeworks
HW3 P, NP, hierarchy theorems, circuits
HW4 NP and PSPACE completeness
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, Algorithms and Complexity, course website, 2020.
Fomin and 7 others. Parameterized algorithms, 2015. (This is an advanced book.)
Mathematical writing
Sosinsky, Как написать математическую статью по-английски, 2000.
Knuth, Technical writing, transcripts of lectures, 1987.
Gillman, Writing Mathematics Well, 1987.
Office hours
Person | Monday | Tuesday | Wednesday | Thursday | Friday |
---|---|---|---|---|---|
Bruno Bauwens, S834, Zoom | 14:00-20:00 |
Warn me in advance by email.