Teaching

Notes

This section contains notes of more expository nature.

- Razborov’ Switching Lemma for k-DNF Resolution
- Random 3-XOR Formulas are Hard for Resolution over k-DNFs—an exposition


Go to top ⇧

Instructor

Fall 2016 Co-instructor of DD2442 Seminars on Theoretical Computer Science.

Fall 2015 Co-instructor for DD2445/FDD3445 Complexity Theory.

Spring 2015 Teacher assistant for Introduzione agli algoritmi.