Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q719966> ?p ?o }
Showing triples 1 to 19 of
19
with 100 triples per page.
- Q719966 subject Q13540920.
- Q719966 subject Q8851973.
- Q719966 abstract "Toda's theorem is a result in computational complexity theory that was proven by Seinosuke Toda in his paper "PP is as Hard as the Polynomial-Time Hierarchy" (1991) and was given the 1998 Gödel Prize.".
- Q719966 wikiPageWikiLink Q1063380.
- Q719966 wikiPageWikiLink Q1143357.
- Q719966 wikiPageWikiLink Q1322138.
- Q719966 wikiPageWikiLink Q13540920.
- Q719966 wikiPageWikiLink Q1417143.
- Q719966 wikiPageWikiLink Q1563053.
- Q719966 wikiPageWikiLink Q205084.
- Q719966 wikiPageWikiLink Q2103034.
- Q719966 wikiPageWikiLink Q3274386.
- Q719966 wikiPageWikiLink Q5177154.
- Q719966 wikiPageWikiLink Q628036.
- Q719966 wikiPageWikiLink Q7911648.
- Q719966 wikiPageWikiLink Q8190500.
- Q719966 wikiPageWikiLink Q8851973.
- Q719966 comment "Toda's theorem is a result in computational complexity theory that was proven by Seinosuke Toda in his paper "PP is as Hard as the Polynomial-Time Hierarchy" (1991) and was given the 1998 Gödel Prize.".
- Q719966 label "Toda's theorem".