Derandomization using Random Strings
Speaker: DavidTitle: Derandomization using Random Strings
Date: 01 Dec 2022 17:45-19:15 EST
Location: SEC Level 3 NW Terrace
Food: Vegan
Many algorithms use randomness. The process of showing that a problem with a fast randomized algorithm has a fast deterministic algorithm is a type of “derandomization”: a complete reduction of its randomness complexity without noticeably disturbing its time complexity. Results of this flavor are satisfying for various philosophical reasons. Attempts to derandomize broad classes of problems typically start by cleverly constructing some deterministic object that acts like a random object under a smaller probability distribution. In this TGINF talk, I will present a derandomization result from Buhrman et. al (2005) and Allender et. al (2006) that uses “pseudorandom” objects but makes no reference to a distribution. In particular, the proof exploits different meanings of the term “random”: something that happens by chance versus something without a concise theory.
Notes for the talk: https://brewster.cc/tginf/random-strings.pdf