Aaron Potechin, Ph.D.Cornell University
Institute for Advanced StudyAaron Potechin, Ph.D.’s website
Aaron Potechin is a postdoctoral researcher with a joint appointment with the Simons Collaboration on Algorithms and Geometry at Cornell University and the Institute for Advanced Study. He obtained his Ph.D. in mathematics from the Massachusetts Institute of Technology in 2015, under the supervision of Jonathan Kelner.
His research focuses on computational complexity theory and combinatorics. For his doctorate, he analyzed monotone space complexity via the switching network model. He is currently working to prove lower bounds for the sum-of-squares hierarchy in the planted clique problem.