Past Member
Aaron Potechin
Funding provided by the Simons Foundation and the National Science Foundation
Affiliation
Mathematics
Field of study
Computational Complexity Theory
From
–
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.
Visits
Member
School of Mathematics
–
Degrees
Massachusetts Institute of Technology
Ph.D.
2015