Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/NE_(complexity)> ?p ?o }
Showing triples 1 to 30 of
30
with 100 triples per page.
- NE_(complexity) abstract "In computational complexity theory, the complexity class NE is the set of decision problems that can be solved by a non-deterministic Turing machine in time O(kn) for some k.NE, unlike the similar class NEXPTIME, is not closed under polynomial-time many-one reductions.".
- NE_(complexity) wikiPageID "663673".
- NE_(complexity) wikiPageLength "548".
- NE_(complexity) wikiPageOutDegree "10".
- NE_(complexity) wikiPageRevisionID "543789271".
- NE_(complexity) wikiPageWikiLink Big_O_notation.
- NE_(complexity) wikiPageWikiLink Category:Complexity_classes.
- NE_(complexity) wikiPageWikiLink Complexity_class.
- NE_(complexity) wikiPageWikiLink Computational_complexity_theory.
- NE_(complexity) wikiPageWikiLink Decision_problem.
- NE_(complexity) wikiPageWikiLink E_(complexity).
- NE_(complexity) wikiPageWikiLink Many-one_reduction.
- NE_(complexity) wikiPageWikiLink NEXPTIME.
- NE_(complexity) wikiPageWikiLink Non-deterministic_Turing_machine.
- NE_(complexity) wikiPageWikiLink Polynomial-time_reduction.
- NE_(complexity) wikiPageWikiLinkText "NE (complexity)".
- NE_(complexity) wikiPageWikiLinkText "NE".
- NE_(complexity) hasPhotoCollection NE_(complexity).
- NE_(complexity) wikiPageUsesTemplate Template:Comp-sci-theory-stub.
- NE_(complexity) wikiPageUsesTemplate Template:ComplexityZoo.
- NE_(complexity) subject Category:Complexity_classes.
- NE_(complexity) hypernym Set.
- NE_(complexity) comment "In computational complexity theory, the complexity class NE is the set of decision problems that can be solved by a non-deterministic Turing machine in time O(kn) for some k.NE, unlike the similar class NEXPTIME, is not closed under polynomial-time many-one reductions.".
- NE_(complexity) label "NE (complexity)".
- NE_(complexity) sameAs m.030wjm.
- NE_(complexity) sameAs Q6953653.
- NE_(complexity) sameAs Q6953653.
- NE_(complexity) sameAs NE_(複雜度).
- NE_(complexity) wasDerivedFrom NE_(complexity)?oldid=543789271.
- NE_(complexity) isPrimaryTopicOf NE_(complexity).