Past Visitor
Srikanth Srinivasan
Affiliation
Mathematics
Field of study
Computational Complexity
From
–
Srikanth Srinivasan’s research is mainly focused on topics in computational complexity, particularly on problems motivated by questions in arithmetic and boolean circuit complexity and pseudorandomness.
Visits
Visitor
School of Mathematics
–
Member
School of Mathematics
–
Degrees
The Institute of Mathematical Sciences
Ph.D.
2010