1. P-printable sets;Allender;SIAM J. Comput.,1988
2. R. Beigel, On the relativized power of additional accepting paths, in: Proc. 4th Structure in Complexity Theory Conf. IEEE Computer Society Press, Silver Spring, MD, 1989, pp. 216–224.
3. B. Borchert, L. Hemaspaandra, J. Rothe, Powers-of-two acceptance suffices for equivalence and bounded ambiguity problems, Technical Report TR-628, Department of Computer Science, University of Rochester, Rochester, NY, June 1996.
4. Looking for an analogue of Rice's Theorem in circuit complexity theory;Borchert,1997
5. The Boolean hierarchy II: Applications;Cai;SIAM J. Comput.,1989