Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:uwspace.uwaterloo.ca:10012/3897

Lower Bounds and Derandomization

Authors
Publication date
1 January 2008
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

Similar works

Full text

thumbnail-image

University of Waterloo's Institutional Repository

redirect
oaioai:uwspace.uwaterloo.ca:10012...
Last time updated on 01/01/2018

This paper was published in University of Waterloo's Institutional Repository.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.