Past Member
David Steurer
Funding provided by the National Science Foundation
Affiliation
Mathematics
Field of Study
Algorithms, Computational Complexity
From
–
David Steurer studies the power and limitations of efficient algorithms for optimization problems. His goal is to develop a unified approach to the design of algorithms for these problems based on the sum-of-squares method. He also pursues a program to refute the unique games conjecture based on this method.
Dates at IAS
Member
School of Mathematics
–
Degrees
Princeton University
Ph.D.
2010