Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Mahaneys_theorem> ?p ?o }
Showing triples 1 to 21 of
21
with 100 triples per page.
- Mahaneys_theorem abstract "Mahaney's theorem is a theorem in computational complexity theory proven by Stephen Mahaney that states that if any sparse language is NP-Complete, then P=NP.".
- Mahaneys_theorem wikiPageID "47241003".
- Mahaneys_theorem wikiPageLength "615".
- Mahaneys_theorem wikiPageOutDegree "5".
- Mahaneys_theorem wikiPageRevisionID "672531344".
- Mahaneys_theorem wikiPageWikiLink Category:Computational_complexity_theory.
- Mahaneys_theorem wikiPageWikiLink Computational_complexity_theory.
- Mahaneys_theorem wikiPageWikiLink NP-completeness.
- Mahaneys_theorem wikiPageWikiLink P_versus_NP_problem.
- Mahaneys_theorem wikiPageWikiLink Sparse_language.
- Mahaneys_theorem wikiPageWikiLinkText "Mahaney's theorem".
- Mahaneys_theorem wikiPageUsesTemplate Template:Compsci-stub.
- Mahaneys_theorem wikiPageUsesTemplate Template:Reflist.
- Mahaneys_theorem subject Category:Computational_complexity_theory.
- Mahaneys_theorem hypernym Theorem.
- Mahaneys_theorem comment "Mahaney's theorem is a theorem in computational complexity theory proven by Stephen Mahaney that states that if any sparse language is NP-Complete, then P=NP.".
- Mahaneys_theorem label "Mahaney's theorem".
- Mahaneys_theorem sameAs Q20707135.
- Mahaneys_theorem sameAs Q20707135.
- Mahaneys_theorem wasDerivedFrom Mahaneys_theorem?oldid=672531344.
- Mahaneys_theorem isPrimaryTopicOf Mahaneys_theorem.