Ketan Mulmuley
Author
Who is 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. 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.
He earned his PhD in computer science from Carnegie Mellon University in 1985 under Dana Scott, winning the 1986 ACM Doctoral Dissertation Award for his thesis Full Abstraction and Semantic Equivalence. He also won a Miller fellowship at the University of California, Berkeley for 1985–1987, and a Guggenheim Foundation Fellowship for the year 1999–2000.
We need you!
Help us build the largest biographies collection on the web!
- Education
- PhD, Carnegie Mellon University
Computer Science
( - 1985)
- PhD, Carnegie Mellon University
- Lived in
- Chicago metropolitan area
Submitted
on July 23, 2013
Citation
Use the citation below to add to a bibliography:
Style:MLAChicagoAPA
"Ketan Mulmuley." Biographies.net. STANDS4 LLC, 2024. Web. 3 May 2024. <https://www.biographies.net/people/en/ketan_mulmuley>.
Discuss this Ketan Mulmuley biography with the community:
Report Comment
We're doing our best to make sure our content is useful, accurate and safe.
If by any chance you spot an inappropriate comment while navigating through our website please use this form to let us know, and we'll take care of it shortly.
Attachment
You need to be logged in to favorite.
Log In