1. K. Ambos-Spies and J. Kämper. On disjunctive self-reducibility. In Proceedings of the 2nd Workshop on Computer Science Logic, pages 1–13. Springer-Verlag Lecture Notes in Computer Science #385, October 1988.
2. J. Balcazar. Self-reducibility. Journal of Computer and System Sciences, 41 (3): 367–388, 1990.
3. J. Balcazar, J. Díaz, and J. Gabarró. Structural Complexity I. EATCS Texts in Theoretical Computer Science. Springer-Verlag, 2nd edition, 1995.
4. L. Berman. On the structure of complete sets. In Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, pages 76–80, 1976.
5. C. Bennett and J. Gill. Relative to a random oracle A, P
A
≠ NP
A
≠ coNP
A
with probability 1. SIAM Journal on Computing, 10: 96–113, 1981.