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]
^Cite error: The named reference iitb was invoked but never defined (see the help page).
^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
KetanMulmuley is a professor in the Department of Computer Science at the University of Chicago, and a sometime visiting professor at IIT Bombay. He specializes...
is a research program in computational complexity theory proposed by KetanMulmuley and Milind Sohoni. The goal of the program is to answer the most famous...
students Jack Copeland Michael Fourman Kenneth Kunen Angus Macintyre Peter Mosses KetanMulmuley Marko Petkovšek Fred S. Roberts David Turner Martin Davies...
English, University of Maine: Professional scribes in medieval England. KetanMulmuley, Professor of Computer Science, University of Chicago: Studies in geometric...
Arora). In 2018, he was elected to the National Academy of Sciences. Mulmuley, Ketan; Vazirani, Umesh V.; Vazirani, Vijay V. (1987), "Matching is as easy...
Geometric Computing. Cambridge University Press. ISBN 0-521-56329-1. KetanMulmuley (1994). Computational Geometry: An Introduction Through Randomized Algorithms...
Home. Association for Computing Machinery. Retrieved 2021-01-23. "Ketan D. Mulmuley". Awards Home. Association for Computing Machinery. Retrieved 2021-01-23...
Journal on Computing. 29 (4): 1118. doi:10.1137/S0097539798339041. Mulmuley, Ketan; Vazirani, Umesh; Vazirani, Vijay (1987). "Matching is as easy as matrix...
Computer Science, pp. 17–27, doi:10.1109/SFCS.1980.12, S2CID 27467816; Mulmuley, Ketan; Vazirani, Umesh V.; Vazirani, Vijay V. (1987), "Matching is as easy...
Global Information