1. S. Aaronson, B. Aydınlıog̃lu, H. Buhrman, J. Hitchcock & D. van Melkebeek, “A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games,” ECCC technical report. TR10-174, 2010.
2. S. Arora, & B. Barak, “Complexity Theory: A Modern Approach,” Cambridge University Press, 2009.
3. V. Arvind & P. Mukhopadhyay, “Derandomizing the isolation lemma and lower bounds for circuit size,” in Proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 12th International Workshop on Randomization and Computation, ser. LNCS 5171, 2008, pp. 276–289.
4. A. Atserias, “Distinguishing SAT from polynomial-size circuits, through black-box queries,” in Proceedings of the 21st Annual IEEE Conference on Computational Complexity, pp. 88–95, 2006.
5. L. Babai, L. Fortnow, N. Nisan & A. Wigderson, “BPP has subexponential simulation unless EXPTIME has publishable proofs,” Computational Complexity, vol. 3, pp. 307–318, 1993.