Aaron Potechin is a researcher in computational complexity theory and combinatorics. Potechin did his undergraduate studies at Princeton University. After graduating from Princeton, he attended part III of the Math Tripos at the University of Cambridge and is now finishing his PhD at MIT. Potechin currently has two main research projects. First, his thesis work, which is a continuation of his undergraduate thesis work at Princeton, is about analyzing space complexity using the switching network model. Potechin's other main research project is about lower bounds for the sum of squares hierarchy, particularly for the planted clique problem.