On the power of probabilistic polynomial time: P/sup NP(log)/ contained in PP
Richard Beigel, HEMACHANDRA L. A., Gerd Wechsung · 2003
It is shown that probabilistic time is closed under polynomial-time parity reductions. Therefore, every set polynomial-time truth-table reducible to SAT is accepted by a probabilistic polynomial-time Turing machine. Equivalently, P/sup NP(log)/ contained in PP.>