1. [1] Ambos-Spies, K., "Problems which cannot be reduced to any proper subproblems", pp. 162–68 in Mathematical Foundations of Computer Science 2003, vol. 2747 of Lecture Notes in Computer Science, Springer, Berlin, 2003.
2. [2] Baker, T., J. Gill, and R. Solovay, "Relativizations of the $\mathcalP=?\mathcalN\mathcalP$" question, SIAM Journal on Computing, vol. 4 (1975), pp. 431–42.
3. [3] Balcázar, J. L., and U. Schöning, "Bi-immune sets for complexity classes", Mathematical Systems Theory. An International Journal on Mathematical Computing Theory, vol. 18 (1985), pp. 1–10.
4. [4] Balcázar, J. L., J. Díaz, and J. Gabarró, Structural Complexity. I, vol. 11 of EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1988.
5. [5] Bovet, D. P., and P. Crescenzi, Introduction to the Theory of Complexity, Prentice Hall International Series in Computer Science. Prentice Hall International, New York, 1994.