Rahul Ilango, Member in the School of Mathematics, studies computational complexity theory, which quantifies the amount of resources—like time and hardware—needed to solve computational tasks. Ilango has a particular interest in problems that bridge complexity theory with other fields, such as cryptography and proof complexity.
