1. 1) Aaronson, S., Oracles are Subtle but not Malicious, Proceedings of the 21st Annual IEEE Conference on Computational Complexity Theory, pp. 340-354 (2006).
2. 2) Aaronson, S., and Wigderson, A., ``Algebrization: A new barrier in complexity theory,'' ACM Transactions on Computation Theory, 1(1) (2009).
3. 3) Ajtai, M., ``Σ11-formulae on finite structures,'' Annals of Pure and Applied Logic, 24: 1-48 (1983).
4. 4) Allender, E., and Gore, V., ``A uniform circuit lower bound for the permanent,'' 23: 1026-1049 (1994).
5. 5) Arora, S., and Barak, B., Complexity Theory: A Modern Approach, Cambridge University Press (2009).