Current Member

Pravesh Kothari

Funding provided by the National Science Foundation
Affiliation
Mathematics
Field of Study
Theoretical Computer Science
Home Institution
Princeton University

Pravesh Kothari is interested in computational complexity theory, with a specific focus on approximation algorithms, hardness of approximation, and pseudorandomness. At IAS, he plans to continue his recent work on understanding the limitations of algorithmic schemes based on linear and semidefinite programming.

Dates at IAS
Member
  • Mathematics
9/2016current
Degrees
The University of Texas at Austin Ph.D., 2016