Date of Award
Spring 5-31-2023
Document Type
Thesis (Undergraduate)
Department
Computer Science
First Advisor
Amit Chakrabarti
Abstract
Saks and Zhou used Nisan’s PRG in a recursive manner to obtain BPL ⊆ L^(3/2). We describe how this framework could be generalized to use arbitrary PRGs following Armoni’s sampler idea. We then give a theorem relating the seed length of a better PRG to the implied improvements in derandomizing BPL. Recently, Hoza used Armoni’s PRG in the Saks-Zhou framework to obtain an even better derandomization. We describe the construction of Armoni’s PRG and conjecture that by using basic components other than extractors, parameters in that construction could be improved. Under some assumptions, we calculate the extent to which such parametrical improvements could produce better derandomization of BPL, noting that proving results better than BPL ⊆ L^(4/3) requires ideas beyond our current suite of techniques.
Recommended Citation
Wang, Boxian, "Exploring Improvements to Space-Bounded Derandomization from Better Pseudorandom Generators" (2023). Computer Science Senior Theses. 4.
https://digitalcommons.dartmouth.edu/cs_senior_theses/4
