1. Relativizations of the P = ? NP question;Bailer;SIAM J. Comput.,1975
2. On the relativized power of additional accepting paths;Beigel,1989
3. Counting classes: Thresholds, parity, mods, and fewness;Beigel,1990
4. On the power of probabilistic polynomial time: pNP[log] ⊆ PP;Beigel,1989
5. Relative to a random oracle A, PA ≠ NPA ≠ co-NPA with probability 1;Bennett;SIAM J. Comput.,1981