Lower Bounds and Derandomization
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.
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/3897 |