Texas A and M University
United States of America
Dr. Scott Aaronson working at computer science department in Texas A & M University, USA
Theoretical Computer Science
Aaronson S, Bouland A, Kuperberg G, Mehraban S. The computational complexity of ball permutations. arXiv preprint arXiv:1610.06646. 2016 Oct 21.
Aaronson S, Chen L. Complexity-theoretic foundations of quantum supremacy experiments. arXiv preprint arXiv:1612.05903. 2016 Dec 18.
Aaronson S, Bavarian M, Gueltrini G. Computability Theory of Closed Timelike Curves. arXiv preprint arXiv:1609.05507. 2016 Sep 18.