Lower Bounds and Derandomization
Abstract
A major open problem in complexity theory is to determine whether randomized complexity classes such as BPP, AM, and MA have any nontrivial derandomization. This thesis investigates the derandomization of two randomized versions of the polynomial hierarchy.
Collections
Cite this version of the work
Jaffer Gardezi
(2008).
Lower Bounds and Derandomization. UWSpace.
http://hdl.handle.net/10012/3897
Other formats