For my grad complexity theory class this sem, I had to create a video explaining a result in complexity theory. The result I chose was “Probabilistic Savitch” (by Borodin, Cook, and Pippenger, and independently by Jung), which shows that even in a seemingly powerful randomized space class, with only a quadratic overhead, you can derandomize any such algorithm.

Check the video out here!