|
|
| Строка 1: |
Строка 1: |
| − | = Classes =
| + | Segeralah Mendaftar langsung di |
| − |
| + | * [https://macanplay.net/ Macanslot] |
| − | Wednesdays 18:10–21:00, on [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 zoom]
| + | * [https://paradox3d.net/ InaTogel] |
| − | | + | * [https://macanwin.net/ QqMacan] |
| − | Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]
| + | * [https://lechers.cc/ RoyalToto] |
| − | | + | * [https://xenogames.net/ JayaTogelUp] |
| − | For practical information join the [https://t.me/+fjwhc1N_Cn1iNmEy telegram group]
| + | * [https://eeooii.info/ Raja Slot4D] |
| − | | + | * [https://139.180.153.95/ Raja Slot4D] |
| − | | + | * [https://209.58.183.93/ JayaTogelUp] |
| − | = Course Materials =
| + | * [https://ronin138.com/ Ronin138] |
| − | | + | * [https://addicthealious.website/ slot 4d] |
| − | | + | * [https://18.142.23.191/ Macan Slot] |
| − | <!-- If you need some background in math, consider these two sources:<br>
| + | * [https://royaltotopedia.com RoyTop88] |
| − | [http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi<br> | + | * [https://macanplay.com MacanSlot] |
| − | [http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)--> | + | * [https://macantoto88.com Toto 88] |
| − | {| class="wikitable"
| + | * [https://jayatogelup.com.com jayatogelup] |
| − | |-
| + | [https://ronin19.com/ Ronin138] |
| − | ! Video !! Summary !! Notes
| + | [https://addicthealing.website/ slot 4d] |
| − | |-
| + | [https://jayatogelcc.cc/ jayatogel] |
| − | || [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://jayatogelcc.cc/ jayatogelcc] |
| − | |-
| + | [http://northcoaststeelhead.com/ northcoaststeelhead.com] |
| − | || 25.01 || Turing machines and register machines || [https://www.dropbox.com/s/jslijos3lp03m83/turingDef.pdf?dl=0 lecture 2]
| + | [http://supremeoutlet.us/ supremeoutlet.us] |
| − | |-
| + | [http://208.78.220.231/ freebet] |
| − | || 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]
| + | [http://blackfridaymichaelkors.us/ freebet] |
| − | |-
| + | [https://supremeshirtshop.us/ supremeshirtshop.us] |
| − | || 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]
| + | [https://macanplayslot.web.fc2.com/ macanplay] |
| − | |-
| + | [https://royaltotopedia4d.web.fc2.com/ royaltotopedia] |
| − | || <span style="color:gray">23.02</span> || <span style="color:gray">Holliday</span> ||
| + | [https://macanplay8.web.fc2.com/ macanplay slot] |
| − | |-
| + | [https://royaltotopedia88.web.fc2.com/ royaltoto] |
| − | || 02.03 || The class NP and NP-completeness || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes]
| + | [https://olxtotos.web.fc2.com/ olxtoto] |
| − | |-
| + | [https://linklist.bio/OLX.TOTO olxtoto] |
| − | || 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]
| + | [https://c.mi.com/thread-4131553-1-0.html olxtoto] |
| − | |-
| + | [https://heylink.me/FAFA138 fafa138] |
| − | || 16.03 || More NP-complete problems || [https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions]
| + | [https://heylink.me/FaFa138 fafa138] |
| − | |-
| + | [https://heylink.me/Fafa138 fafa138] |
| − | || 23.03 || Games, PSPACE, Savich theorem, completeness of TQBF || [https://www.dropbox.com/s/77sr5nhne411ahz/classPSPACE.pdf?dl=0 pspace]
| + | [https://magic.ly/FAFA138 fafa138] |
| − | |-
| + | [https://fafa138slot.web.fc2.com fafa138] |
| − | || 30.03 || Parameterized complexity I: the class FPT and kernelization || [https://www.dropbox.com/s/khol9uoy24l6rmg/paramComp.pdf?dl=0 notes]
| + | [https://heylink.me/FAFA138 fafa138] |
| − | |-
| + | [http://ec2-13-250-3-146.ap-southeast-1.compute.amazonaws.com/ fafa138] |
| − | || 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 =
| + | |
| − | | + | |
| − | {| 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.
| + | |
