A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes

摘要

We show a simple application of Zukerman's amplification technique to the classification problem of the probabilistic polynomial time hierarchy formed by interleaving all possible oracle classes from BPP,RP,coRP and ZPP, in any finite number of levels. In the fault Tolerant model introduced by Cai, Hemachandra and Vyskoc, we arrive at complete classification.