Lower Bounds and Derandomization
MetadataShow full item record
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.
Cite this version of the work
Jaffer Gardezi (2008). Lower Bounds and Derandomization. UWSpace. http://hdl.handle.net/10012/3897