Scott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban. The computational complexity of ball permutations. In Hamed Hatami, Pierre McKenzie, Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. pages 317-327, ACM, 2017. [doi]
@inproceedings{AaronsonBKM17,
title = {The computational complexity of ball permutations},
author = {Scott Aaronson and Adam Bouland and Greg Kuperberg and Saeed Mehraban},
year = {2017},
doi = {10.1145/3055399.3055453},
url = {http://doi.acm.org/10.1145/3055399.3055453},
researchr = {https://researchr.org/publication/AaronsonBKM17},
cites = {0},
citedby = {0},
pages = {317-327},
booktitle = {Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017},
editor = {Hamed Hatami and Pierre McKenzie and Valerie King},
publisher = {ACM},
isbn = {978-1-4503-4528-6},
}