Probabilistic Complexity Classes

Abstract

The purpose of this work is to present an overview of the class of problems solvable in probabilistic polynomial time with double sided error (PP). We explore the relationship of PP to other complexity classes, in particular NP and the polynomial hierarchy, and discuss closure under some standard operations such as intersection and complementation. New proofs are given of some results from the literature using techniques developed by the author. ii