Curious about the limits of computation.
I am a first year PhD student at the University of Oxford, fortunate to be advised by Professor Rahul Santhanam. I study computational complexity — I am interested in meta-complexity, circuit complexity, unconditional lower bounds, pseudorandomness and structural complexity. Below are some key areas of interest!
Publications
Research Interests
Algorithmic method
How can we leverage non-trivial positive results about the feasibility of certain algorithmic tasks, to demonstrate separations between complexity classes?
Uniformity
How can we tailor state of the art arguments for separating complexity classes to take advantage of uniformity? How does this interact with meta-computational notions?
Explicit Constructions
For what classes of objects can we develop explicit constructions of them?
Meta-complexity
How do meta-computational notions such as time-bounded Kolmogorov complexity and circuit size interact with all of the above questions?