ACM Press, 1996. 3 E. Allender and M. Ogihara. 4 R. Beigel, L. Hemachandra, and G. Wechsung. Probabilistic polynomial time is closed under parity reductions. 5 B. Borchert, L. Hemaspaandra, and J. Rothe.
Restrictive acceptance suffices for equivalence problems.
London Mathematical Society Journal of Computation and Mathematics . 6 J. Cai and L. Hemachandra. On the power of parity polynomial time. 7 J. Cai and L. Hemachandra. A note on enumerative counting.