Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6395317> ?p ?o }
Showing triples 1 to 44 of
44
with 100 triples per page.
- Q6395317 description "Computer scientist".
- Q6395317 description "Computer scientist".
- Q6395317 subject Q5312304.
- Q6395317 subject Q7453817.
- Q6395317 subject Q9580543.
- Q6395317 abstract "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.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.".
- Q6395317 wikiPageExternalLink ?id=XLqhQgAACAAJ.
- Q6395317 wikiPageExternalLink ?id=rjgZAQAAIAAJ.
- Q6395317 wikiPageExternalLink ramakrishnadas.cs.uchicago.edu.
- Q6395317 wikiPageExternalLink mulmuley.
- Q6395317 wikiPageWikiLink Q127992.
- Q6395317 wikiPageWikiLink Q131252.
- Q6395317 wikiPageWikiLink Q1661242.
- Q6395317 wikiPageWikiLink Q168756.
- Q6395317 wikiPageWikiLink Q17141967.
- Q6395317 wikiPageWikiLink Q180969.
- Q6395317 wikiPageWikiLink Q190080.
- Q6395317 wikiPageWikiLink Q205084.
- Q6395317 wikiPageWikiLink Q2878974.
- Q6395317 wikiPageWikiLink Q49823.
- Q6395317 wikiPageWikiLink Q5312304.
- Q6395317 wikiPageWikiLink Q6085965.
- Q6395317 wikiPageWikiLink Q7453817.
- Q6395317 wikiPageWikiLink Q746242.
- Q6395317 wikiPageWikiLink Q92702.
- Q6395317 wikiPageWikiLink Q92805.
- Q6395317 wikiPageWikiLink Q9580543.
- Q6395317 name "Mulmuley, Ketan".
- Q6395317 shortDescription "Computer scientist".
- Q6395317 type Person.
- Q6395317 type Agent.
- Q6395317 type Person.
- Q6395317 type Agent.
- Q6395317 type NaturalPerson.
- Q6395317 type Thing.
- Q6395317 type Q215627.
- Q6395317 type Q5.
- Q6395317 type Person.
- Q6395317 comment "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.".
- Q6395317 label "Ketan Mulmuley".
- Q6395317 givenName "Ketan".
- Q6395317 name "Ketan Mulmuley".
- Q6395317 name "Mulmuley, Ketan".
- Q6395317 surname "Mulmuley".