1. The complexity of sparse sets in P;Allender,1986
2. Self-reducibility;Balcázar;J. Comput. System Sci.,1990
3. On the power of probabilistic polynomial time: PNP[log] ⊆ PP;Beigel,1989
4. Promise problems and access to unambiguous computation;Cai,1993
5. Classi helping relativizzate;Cintioli,1996