-
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...
-
research program in com****tional
complexity theory proposed by
Ketan Mulmuley and
Milind Sohoni. The goal of the
program is to
answer the most famous...
-
problem of
detecting whether a
Boolean formula has a
unique solution.
Mulmuley,
Vazirani &
Vazirani (1987)
introduced an
isolation lemma of a slightly...
-
prevent appearance of
artificial edges in the
possible solution. As
shown by
Mulmuley,
Vazirani and Vazirani, the
problem of
minimum weight perfect matching...
-
coefficients is #P-hard and
contained in GapP. A
recent work by Ikenmeyer,
Mulmuley &
Walter (2017)
shows that
deciding whether a
given Kronecker coefficient...
-
Sanjeev Arora). In 2018, he was
elected to the
National Academy of Sciences.
Mulmuley, Ketan; Vazirani,
Umesh V.; Vazirani,
Vijay V. (1987), "Matching is as...
-
students Jack
Copeland Michael Fourman Kenneth Kunen Angus Macintyre Peter Mosses Ketan Mulmuley Marko Petkovšek Fred S.
Roberts David Turner Martin Davies...
-
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...
-
dependence on k, the
number of crossings, can be improved.
Clarkson (1988) and
Mulmuley (1988) both
provided randomized algorithms for
constructing the planar...
- 1145/972639.972643. S2CID 8665271. K.
Regan (October 2002). "Understanding the
Mulmuley-Sohoni
Approach to P vs. NP" (PDF).
Bulletin of the
European ****ociation...
