<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ru">
	<id>https://wikicshse.ru/index.php?action=history&amp;feed=atom&amp;title=Theoretical_computer_science_spring_2023</id>
	<title>Theoretical computer science spring 2023 - История изменений</title>
	<link rel="self" type="application/atom+xml" href="https://wikicshse.ru/index.php?action=history&amp;feed=atom&amp;title=Theoretical_computer_science_spring_2023"/>
	<link rel="alternate" type="text/html" href="https://wikicshse.ru/index.php?title=Theoretical_computer_science_spring_2023&amp;action=history"/>
	<updated>2026-06-06T13:20:12Z</updated>
	<subtitle>История изменений этой страницы в вики</subtitle>
	<generator>MediaWiki 1.45.3</generator>
	<entry>
		<id>https://wikicshse.ru/index.php?title=Theoretical_computer_science_spring_2023&amp;diff=744&amp;oldid=prev</id>
		<title>imported&gt;Bauwens: Migrated current public revision from wiki.cs.hse.ru</title>
		<link rel="alternate" type="text/html" href="https://wikicshse.ru/index.php?title=Theoretical_computer_science_spring_2023&amp;diff=744&amp;oldid=prev"/>
		<updated>2023-04-26T14:59:26Z</updated>

		<summary type="html">&lt;p&gt;Migrated current public revision from wiki.cs.hse.ru&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Новая страница&lt;/b&gt;&lt;/p&gt;&lt;div&gt;= Classes =&lt;br /&gt;
 &lt;br /&gt;
Wednesdays 18:10–21:00, in room S834. &lt;br /&gt;
&lt;br /&gt;
Teacher: [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens]&lt;br /&gt;
&lt;br /&gt;
Homeworks need to be emailed to brbauwens -at- gmail.com before the start of the lecture next lecture. Put tcs in the subject line.&lt;br /&gt;
&lt;br /&gt;
For practical information ask to join the telegram group. &lt;br /&gt;
&lt;br /&gt;
[https://www.dropbox.com/scl/fi/2opgvanhsuuqyrt1z5zhl/scores.ods?dl=0&amp;amp;rlkey=v0htrtejs04c1pujinri7ozqj Scores]&lt;br /&gt;
&lt;br /&gt;
= Course Materials =&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;!-- If you need some background in math, consider these two sources:&amp;lt;br&amp;gt;&lt;br /&gt;
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi&amp;lt;br&amp;gt;&lt;br /&gt;
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)--&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
! Video !! Summary !! Notes !! Homework &lt;br /&gt;
|-&lt;br /&gt;
 || [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 &amp;amp; 2] || [https://www.dropbox.com/s/okcga6o20qsrxe2/1_HW.pdf?dl=0 hw1]&lt;br /&gt;
|- &lt;br /&gt;
 || 15.02 || Regular languages 2: nondeterministic automata and regular expressions || || [https://www.dropbox.com/s/4ylwf3hdoncym8v/2_HW.pdf?dl=0 hw2]&lt;br /&gt;
|- &lt;br /&gt;
 || 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]&lt;br /&gt;
|- &lt;br /&gt;
 || 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]&lt;br /&gt;
|-&lt;br /&gt;
 || 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]&lt;br /&gt;
|-&lt;br /&gt;
 || 29.03 || Completeness ||  [https://www.dropbox.com/s/ykbkpjm4as46nay/incompleteness.pdf?dl=0 3.B] || [https://www.dropbox.com/s/5r16xyv2q65dt4m/6_HW.pdf?dl=0 hw6]&lt;br /&gt;
|- &lt;br /&gt;
 || 12.04 || (online, in zoom) The classes P, EXP, PSPACE, EXPSPACE. Time and space hierarchy theorems.  ||  See Sipser chapts 7 and 8 || [https://www.dropbox.com/s/t25x38vop05xnlu/7_HW.pdf?dl=0 hw7]&lt;br /&gt;
|- &lt;br /&gt;
|| 19.04 || The class NP, NP-completeness, reduction from SAT to IND-SET || [https://www.dropbox.com/s/90m0yxt62f02mmm/classNP.pdf?dl=0 notes] || [https://www.dropbox.com/s/pxawna41u2xumim/8_HW.pdf?dl=0 hw8]&lt;br /&gt;
|- &lt;br /&gt;
|| 26.04 || Reductions. Proof of the Levin-Cook theorem. ||[https://www.dropbox.com/s/nen161dakmq3646/circuits.pdf?dl=0 circuits][https://www.dropbox.com/s/wlrssw0q1tfx49p/moreReductions.pdf?dl=0 reductions] || [https://www.dropbox.com/s/f3t6ob6fuvi9fhe/9_HW.pdf?dl=0 hw9]&lt;br /&gt;
|- &lt;br /&gt;
 || 17.05 || Exam. Start at 16h00. [https://www.dropbox.com/s/dfv4vehr2mqbxrw/coll.pdf?dl=0 Theory questions.] Also solve 4 exercises as in the homework, including 1 NP-completeness proof.&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
= Grading =&lt;br /&gt;
&lt;br /&gt;
Homework: 35%&lt;br /&gt;
&lt;br /&gt;
Theory exam: 35%&lt;br /&gt;
&lt;br /&gt;
Problem solving exam: 30%&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Passing threshold is 4/10. Grades above 5/10 are rounded up, the other grades are rounded down. &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
= References =&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Basic math&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
Golovnev, Kulikov, Podolskii, Shen, Discrete mathematics for computer science, 2020. &lt;br /&gt;
&lt;br /&gt;
[http://www.cs.elte.hu/~lovasz/dmbook.ps Lecture notes: Discrete Mathematics], L. Lovasz, K. Vesztergombi&lt;br /&gt;
&lt;br /&gt;
[http://rubtsov.su/public/DM-HSE-Draft.pdf Лекции по дискретной математике] (черновик учебника, in Russian)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Computational complexity&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
Sipser, Introduction to the theory of computation&amp;quot;, 3rd edition, 2013, chapters 1, 2–8. (Short and good for basic understanding.)&lt;br /&gt;
&lt;br /&gt;
Mertens and Moore, The Nature of Computation, 2011. (Pleasant reading, loads of interesting background, but rather large.)&lt;br /&gt;
&lt;br /&gt;
Arora and Barak, Computational Complexity, 2009. (Use this after you made many exercises in the above books.)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Mathematical writing&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&lt;br /&gt;
Sosinsky, [http://www.ega-math.narod.ru/Quant/ABS.htm Как написать математическую статью по-английски], 2000.&lt;br /&gt;
&lt;br /&gt;
Knuth,  [https://jmlr.csail.mit.edu/reviewing-papers/knuth_mathematical_writing.pdf Technical writing], transcripts of lectures, 1987.&lt;br /&gt;
&lt;br /&gt;
Gillman, Writing Mathematics Well, 1987.&lt;br /&gt;
&amp;lt;!-- Strunk and White, [https://www.dropbox.com/s/7e6fcdpx3nubvko/strunk-white-1979-elements-of-style.pdf?dl=0 The elements of style], 1979.--&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
= Office hours =&lt;br /&gt;
&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
|-&lt;br /&gt;
!  Person !! Monday !! Tuesday !! Wednesday !! Thursday !! Friday &lt;br /&gt;
|-&lt;br /&gt;
|  [https://www.hse.ru/en/org/persons/160550073 Bruno Bauwens], S834, [https://us02web.zoom.us/j/82300259484?pwd=NWxXekxBeE5yMm9UTmwvLzNNNGlnUT09 Zoom] ||  || || 14:00-18:00 ||  || &lt;br /&gt;
|}&lt;br /&gt;
Warn me in advance by email.&lt;/div&gt;</summary>
		<author><name>imported&gt;Bauwens</name></author>
	</entry>
</feed>