Lower Bounds and Derandomization
Loading...
Date
2008-08-26T20:17:03Z
Authors
Gardezi, Jaffer
Advisor
Journal Title
Journal ISSN
Volume Title
Publisher
University of Waterloo
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.
Description
Keywords
Complexity, Derandomization