The computational complexity of ball permutations - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Scott Aaronson' in GoogleThis author has not been identified. Look up 'Adam Bouland' in GoogleThis author has not been identified. Look up 'Greg Kuperberg' in GoogleThis author has not been identified. Look up 'Saeed Mehraban' in Google

runs on WebDSL