معرفی
Aaron Potechin is an Associate Professor in the Department of Computer Science at the University of Chicago. His research focuses on computational complexity theory, discrete mathematics, and the sum-of-squares (SoS) hierarchy. He has contributed to areas such as constraint satisfaction problems (CSPs), space complexity via switching networks, and the analysis of random matrices. Potechin’s work bridges theoretical computer science with mathematical foundations, including algorithm design and logic.
He holds an NSF grant for investigating the SoS hierarchy (CCF 2008920) and has been affiliated with the Theoretical Computer Science Group at UChicago. His academic journey includes a postdoctoral fellowship at KTH Royal Institute of Technology and notable awards like the Churchill Scholarship and NSF Graduate Research Fellowship.
His research interests span: (1) the SoS hierarchy’s applications in combinatorial optimization, (2) approximability of CSPs, and (3) switching networks for space complexity. Recent work includes lower bounds for non-Gaussian component analysis and densest k-subgraph problems.
- Education Highlights: Recipient of the Barry M. Goldwater Scholarship (2008), Churchill Scholarship (2008), and NSF Graduate Research Fellowship.
- Grants: NSF Grant CCF 2008920 for SoS research.
- Awards: 2010 Machtey Award, 2009 George B. Covington Prize.
Potechin teaches graduate courses on the SoS hierarchy, communication complexity, and statistical physics methods, alongside undergraduate courses in discrete mathematics and algorithms. His lab focuses on advancing theoretical computer science through rigorous mathematical frameworks.
