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.[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]
Education
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.[6]
Honors, awards and positions
Mulmuley's doctoral thesis Full Abstraction and Semantic Equivalence was awarded the 1986 ACM Doctoral Dissertation Award.[7] He was awarded a Miller fellowship at the University of California, Berkeley for 1985–1987,[8] was a fellow at the David and Lucile Packard Foundation[9] 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.[10]
Books
- Jonah Blasiak; Ketan Mulmuley; Milind Sohoni (2015), Geometric Complexity Theory IV: Nonstandard Quantum Group for the Kronecker Problem, American Mathematical Society, ISBN 978-1-4704-2227-1
- Ketan Mulmuley (1985), Full abstraction and semantic equivalence, MIT Press, ISBN 978-0-262-13227-5
- Ketan Mulmuley (1994), Computational geometry: an introduction through randomized algorithms, Prentice-Hall, ISBN 978-0-13-336363-0
References
- ^ a b c Page at IIT Bombay (visiting professor)
- ^ Lance Fortnow, "Status of the P vs NP Problem", CACM, September 2009
- ^ 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
- ^ The Isolation Lemma and Beyond, by Richard J. Lipton
- ^ Foundation Day - Distinguished Alumni, Young Alumni Achievers and Research Awards presented
- ^ "Ketan Mulmey".
- ^ "ACM Award citation". Archived from the original on 2012-05-04. Retrieved 2010-05-09.
- ^ Miller Institute for Basic Research in Science Celebrating 50 years
- ^ David and Lucile Packard Foundation About Ketan D. Mulmuley's Work
- ^ Theory Group Department of Computer Science Faculty List
External links
- Faculty page Archived 2010-05-01 at the Wayback Machine
- List of recent publications
- Ketan Mulmuley at the Mathematics Genealogy Project