Siddhesh Joshi

Ketan Mulmuley

Updated on
Share on FacebookTweet on TwitterShare on LinkedIn
Name  Ketan Mulmuley

Ketan Mulmuley httpswwwcsuchicagoedusitescsfilesstyles
Education  Carnegie Mellon University (1985)
Books  Computational Geometry, Full Abstraction and Semantic Equivalence
Awards  Guggenheim Fellowship for Natural Sciences, US & Canada

Ketan mulmuley on p vs np geometric complexity theory and the riemann hypothesis i

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.


Ketan Mulmuley Ketan Mulmuley On P vs NP Geometric Complexity Theory and the

He earned his PhD in computer science from Carnegie Mellon University in 1985 under Dana Scott, winning the 1986 ACM Doctoral Dissertation Award for his thesis Full Abstraction and Semantic Equivalence. He also won a Miller fellowship at the University of California, Berkeley for 1985–1987, and a Guggenheim Foundation Fellowship for the year 1999–2000.

Ketan mulmuley on p vs np geometric complexity theory and the riemann hypothesis iii


  • 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

    Ketan Mulmuley Wikipedia

    Similar Topics
    Journey into Self (1968 film)
    Marzio Bruseghin
    Tammy May