Ketan Mulmuley
Ketan Mulmuley | |
|---|---|
| Occupation | Academic |
| Title | Professor of Computer Science |
| Academic background | |
| Education | Indian Institute of Technology, Bombay (B.Tech.) Carnegie Mellon University (PhD) |
| Thesis | Full Abstraction and Semantic Equivalence (1985) |
| Doctoral advisor | Dana Scott |
| Academic work | |
| Main interests | Geometric complexity theory P versus NP problem |
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. He is also known for his result with Umesh Vazirani and Vijay Vazirani that showed that "Matching is as easy as matrix inversion", in a paper that introduced the isolation lemma.