ACM Symposium on Theory of Computing, STOC 2017


Article Details
Title: The computational complexity of ball permutations
Article URLs:
Alternative Article URLs:
Authors: Scott Aaronson
  • UT Austin Austin, Texas, USA, Department of Computer Science
Adam Bouland
  • Massachusetts Institute of Technology, CSAIL
Greg Kuperberg
  • UC Davis Davis, California, USA, Department of Mathematics
Saeed Mehraban
  • Massachusetts Institute of Technology, CSAIL
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1122374, 1249349, 1319245
DBLP Key: conf/stoc/AaronsonBKM17
Author Comments:

Discuss this paper and its artifacts below