Title: Probabilistic polynomial time is closed under parity reductions
Authors: Richard Beigel, Lane Hemachandra, and Gerd Wechsung
Abstract:
We show that probabilistic polynomial time (PP) is closed under
polynomial-time parity reductions. As corollaries, we show that
several complexity classes are contained in PP.