Assistant Professor, University of Chicago
Aaron Potechin is an Assistant Professor in the Department of Computer Science at the University of Chicago. He is broadly interested in discrete mathematics and particularly interested in computational complexity theory. His current research focus is on the sum of squares hierarchy, a hierarchy of semidefinite programs which is one of the most powerful tools known for combinatorial optimization problems.
Lower Bounds in Computational Complexity , Fall 2018Visiting Scientist
Fine-Grained Complexity and Algorithm Design , Fall 2015Research Fellow