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...

is a research program in computational complexity theory proposed by Ketan Mulmuley 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 Ketan Mulmuley Marko Petkovšek Fred S. Roberts David Turner Martin Davies...

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...

English, University of Maine: Professional scribes in medieval England. Ketan Mulmuley, Professor of Computer Science, University of Chicago: Studies in geometric...

problem can be solved by a polylogarithmic-time parallel algorithm) and Ketan Mulmuley has suggested an approach to resolving this question that relies on...

doi:10.1007/s11590-021-01791-4. ISSN 1862-4480. S2CID 238644205. Mulmuley, Ketan; Vazirani, Umesh; Vazirani, Vijay (1987). "Matching is as easy as matrix...

Geometric Computing. Cambridge University Press. ISBN 0-521-56329-1. Ketan Mulmuley (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...

{1}{1-x_{i}y_{j}z_{k}}}.} Littlewood–Richardson coefficient Ikenmeyer, Christian; Mulmuley, Ketan D.; Walter, Michael (2017-12-01). "On vanishing of Kronecker coefficients"...

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...

Journal on Computing. 29 (4): 1118. doi:10.1137/S0097539798339041. Mulmuley, Ketan; Vazirani, Umesh; Vazirani, Vijay (1987). "Matching is as easy as matrix...