Ketan Mulmuley is a professor in the Department of Computer Science at the University of Chicago, and a sometime visiting professor at IIT Bombay. He specializes in theoretical computer science, especially computational complexity theory, and in recent years has been working on "geometric complexity theory", an approach to the P versus NP problem through the techniques of algebraic geometry, with Milind Sohoni of IIT Bombay.Lance Fortnow, "Status of the P vs NP Problem", CACM, September 2009 He is also known for his result with Umesh Vazirani and Vijay Vazirani that showed that "Matching is as easy as matrix inversion", STOC version: in a paper that introduced the isolation lemma.The Isolation Lemma and Beyond, by Richard J. Lipton
Education Mulmuley earned his Bachelors of Technology in Electrical Engineering from IIT BombayFoundation Day - Distinguished Alumni, Young Alumni Achievers and Research Awards presented and earned his PhD in computer science from Carnegie Mellon UniversityPage at IIT Bombay (visiting professor) in 1985 under Dana Scott.
Honors, awards and positions Mulmuley's doctoral thesis Full Abstraction and Semantic Equivalence was awarded the 1986 ACM Doctoral Dissertation Award. He was awarded a Miller fellowship at the University of California, Berkeley for 1985–1987,Miller Institute for Basic Research in Science Celebrating 50 years was a fellow at the David and Lucile Packard FoundationDavid and Lucile Packard Foundation About Ketan D. Mulmuley's Work in 1990, and was later awarded Guggenheim Foundation Fellowship for the year 1999–2000. He currently holds a professorship at the University of Chicago, where he is a part of the Theory Group.Theory Group Department of Computer Science Faculty List
Books
References
External links Faculty page List of recent publications