Rozdíly

Zde můžete vidět rozdíly mezi vybranou verzí a aktuální verzí dané stránky.

--- teaching:stfa2223 [2022/10/12 11:04] – vytvořeno Martin Koutecky
+++ teaching:stfa2223 [2023/03/10 20:23] (aktuální) – audio recordings Martin Koutecky
@@ Řádek 1: / Řádek 1: @@
-There are {{ :teaching:stfa2223:stfa-notes.pdf |lecture notes}}. They start with something about fixed dimension which you can ignore.
+There are {{ :teaching:stfa2223:stfa-notes.pdf |lecture notes}}. They start with something about fixed dimension which you can ignore. They contain more stuff about voting rules and manipulating actions than you need.
-For future material, I will either be able to cover it in the notes, or I will give pointers to statements and proofs in other material (papers).
+Kuba K. got some [[https://mega.nz/folder/4B0nzYBB#alpopv0S9VKdQbynk5YZBQ|audio recordings]] of (some of) the lectures. They may or may not be helpful, but I'm leaving that up to you. Thanks, Kuba :)
+Other material:
+  * [[http://www2.imm.dtu.dk/courses/02917/Presburger1.pdf|Slides for Cooper's Algorithm]]
+  * Goemans & Rothvoss: [[https://dl.acm.org/doi/10.1145/3421750|Polynomiality of Bin Packing with Few Item Types]]. You should understand the statement of the Structure Theorem (Thm 2.3), and how the main algorithmic result (Thm 2.2) can be proven using Thm 2.3. We have also proven Lemma 3.4 ("concentrating" the weight from many points to just $2^d$ points) and Lemma 4.3 ("distributing" the weight from the inside of a parallelepiped to its vertices).