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. Provided by Wikipedia
Showing 1 - 1 results of 1 for search 'Mulmuley, Ketan,', query time: 0.04s Refine Results
Search Tools: Get RSS Feed — Email this Search