Prof. Ketan Mulmuley is a Professor at the Computer Science Department in the University of Chicago. His work on ‘geometric complexity theory’, an approach to the P versus NP problem through the techniques of algebraic geometry has been widely recognized.

Prof. Mulmuley did his B.Tech. from IIT Bombay and then went on to complete his Ph.D. in Computer Science from Carnegie Mellon University. He is a recipient of Miller Research fellowship at the University of California, Berkeley (1985-1987). He is also the winner of Guggenheim Fellowship for the year 1999-2000.

Prof. Mulmuley takes keen interest in Dhrupad (Hindustani Classical music) and hiking.