C Ramya

IMSc, Chennai

Dr Ramya is currently a faculty member in the Theoretical Computer Science Group at the Institute of Mathematical Sciences (IMSc), Chennai. Prior to this, she was an Assistant Professor at the Chennai Mathematical Institute and was a postdoctoral fellow at TIFR, Mumbai. She earned her PhD from the Indian Institute of Technology, Madras, and her research focuses on computational complexity, which aims to understand the inherent limitations of computing and the intrinsic hardness of certain computational problems. She is interested in computational problems with an algebraic or combinatorial flavor. She was selected as a Associate of IASc in 2025.

C Ramya

Session 2A – Lectures by Fellows/Associates

Chairperson: Sanoli Gun, IMSc, Chennai

Multiple Facets of Computational Complexity

In the quest to solve real-world problems, obtaining algorithms that are efficient in terms of computational resources such as time, space, randomness, and communication is vital. In Complexity Theory, we are primarily interested in understanding the inherent difficulty of a computational task and in classifying problems as 'easy' or 'hard' irrespective of the state- of-the-art machines on which they are solved. Several algebraic computations are of practical importance, viz., computing the matrix product, discrete Fourier transform, determinant of a matrix, etc. In this talk, we will be primarily interested in the algorithmic as well as complexity-theoretic viewpoint of algebraic computation.

© 2026 Indian Academy of Sciences, Bengaluru.