Title: Probabilistic polynomial time is closed under parity reductions
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.