1. Aaronson, S. (2013a). Quantum computing since Democritus. New York: Cambridge University Press.
2. Aaronson, S. (2013b). Why philosophers should care about computational complexity. In B. J. Copeland, C. J. Posy, & O. Shagrir (Eds.), Computability: Turing, Gödel, Church, and beyond (pp. 261–327). Cambridge, MA: MIT Press.
3. Aaronson, S. (2016). Complexity zoo. https://complexityzoo.uwaterloo.ca/Complexity_Zoo
4. Agrawal, M., Kayal, N., & Saxena, N. (2004). PRIMES is in P. Annals of Mathematics, 160, 781–793.
5. Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2007). Adiabatic quantum computation is equivalent to standard quantum computation. SIAM Journal on Computing, 37, 166–194.