1. E. Allender and L. Hemachandra, in preparation.
2. E. Allender and O. Watanabe, Kolmogorov complexity and degrees of tally sets, Proc. 3rd Structure in Complexity Theory Conference, pp. 102–111.
3. A. Amir, R. Beigel, and W. Gasarch, Cheatable, P-terse, and P-superterse Sets, manuscript.
4. A. Amir and W. Gasarch, 1987 Polynomial Terse Sets, Information and Computation 77, 37–56.
5. T. Baker, J. Gill, and R. Solovay, 1975 Relativizations of the P=?NP question, SIAM J. Comput. 4, 431–444.