Heller, Hans (1986), "On relativized exponential and probabilistic complexity classes", Information and Control, 71 (3): 231–243, doi:10.1016/S0019-9958(86)80012-2
Goldreich, Oded (2011). "In a World of P=BPP"(PDF). In Goldreich, Oded (ed.). Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman. Lecture Notes in Computer Science. Vol.6650. Springer. pp.191–232. doi:10.1007/978-3-642-22670-0_20.
Babai, László; Fortnow, Lance; Nisan, Noam; Wigderson, Avi (1993). "BPP has subexponential time simulations unless EXPTIME has publishable proofs". Computational Complexity. 3 (4): 307–318. doi:10.1007/bf01275486. S2CID14802332.
Russell Impagliazzo and Avi Wigderson (1997). "P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma". Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 220–229. doi:10.1145/258533.258590
Goldreich, Oded (2011). "In a World of P=BPP"(PDF). In Goldreich, Oded (ed.). Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman. Lecture Notes in Computer Science. Vol.6650. Springer. pp.191–232. doi:10.1007/978-3-642-22670-0_20.
