Rahul Ilango

Rahul Ilango studies computational complexity theory, where a central goal is to find faster algorithms or prove no faster algorithms exist. He is particularly interested in questions that bridge complexity theory with related areas such as cryptography and proof complexity. One such direction is better understanding algorithms for the "Minimum Circuit Size Problem," which plays a central role in all these areas.