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]
Mulmuley earned his Bachelors of Technology in Electrical Engineering from IIT Bombay[5] and earned his PhD in computer science from Carnegie Mellon University[1] in 1985 under Dana Scott.
Mulmuley's doctoral thesis Full Abstraction and Semantic Equivalence was awarded the 1986 ACM Doctoral Dissertation Award.[6] He was awarded a Miller fellowship at the University of California, Berkeley for 1985–1987,[7] was a fellow at the David and Lucile Packard Foundation[8] in 1990, and was later awarded Guggenheim Foundation Fellowship for the year 1999–2000.[1] He currently holds a professorship at the University of Chicago, where he is a part of the Theory Group.[9]
This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.
Lokasi Pengunjung: 3.147.195.163