Past Visitor
Madhur Tulsiani
Affiliation
Mathematics
Field of Study
Theoretical Computer Science
From
–
Madhur Tulsiani is interested in complexity theory, particularly in hardness of approximation and convex relaxations of optimization problems. He has also been trying to understand some connections between complexity theory and arithmetic combinatorics.
Dates at IAS
Visitor
School of Mathematics
–
Member
School of Mathematics
–
Degrees
University of California, Berkeley
Ph.D.
2009