Field of Study
Computational Complexity Theory
From 9/2016 – 7/2017:
Aaron Potechin’s current research is on the performance of the sum of squares hierarchy, a powerful generalization of semi-definite programming. While at IAS, he plans to continue this research and to work on circuit lower bounds.