1. M. Abadi, J. Feigenbaum, and J. Kilian. On hiding information from an oracle. Journal of Computer and System Sciences, 39:21–50, 1989.
2. E. Allender, R. Beigel, U. Hertrampf, and S. Homer. Almost-everywhere complexity hierarchies for nondeterministic time. Theoretical Computer Science, 115:225–241, 1993.
3. R. Beigel. On the relativized power of additional accepting paths. In Proceedings of the 4th Structure in Complexity Theory Conference, pages 216–224. IEEE Computer Society Press, June 1989.
4. Technical Report;J. Cai,1997
5. P. Crescenzi and R. Silvestri. Sperner’s lemma and robust machines. In Proceedings of the 8th Structure in Complexity Theory Conference, pages 194–199. IEEE Computer Society Press, May 1993.