Ketan Mulmuley

Ketan Mulmuley is a professor in the Department of Computer Science at the University of Chicago, and a sometime visiting professor at IIT Bombay.[1] 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.[2] He is also known for his result with Umesh Vazirani and Vijay Vazirani that showed that "Matching is as easy as matrix inversion",[3] in a paper that introduced the isolation lemma.[4]

  1. ^ Cite error: The named reference iitb was invoked but never defined (see the help page).
  2. ^ Lance Fortnow, "Status of the P vs NP Problem", CACM, September 2009
  3. ^ Mulmuley, K.; U. V Vazirani; V. V Vazirani (1987), "Matching is as easy as matrix inversion", Combinatorica, 7 (1): 105–113, CiteSeerX 10.1.1.70.2247, doi:10.1007/BF02579206, S2CID 47370049. STOC version: doi:10.1145/28395.383347
  4. ^ The Isolation Lemma and Beyond, by Richard J. Lipton