Matches in DBpedia 2014 for { <http://dbpedia.org/resource/NE_(complexity)> ?p ?o. }
Showing items 1 to 19 of
19
with 100 items 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) wikiPageRevisionID "543789271".
- NE_(complexity) hasPhotoCollection NE_(complexity).
- NE_(complexity) subject Category:Complexity_classes.
- NE_(complexity) type Abstraction100002137.
- NE_(complexity) type Class107997703.
- NE_(complexity) type Collection107951464.
- NE_(complexity) type ComplexityClasses.
- NE_(complexity) type Group100031264.
- 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) label "NE (複雜度)".
- NE_(complexity) sameAs m.030wjm.
- NE_(complexity) sameAs Q6953653.
- NE_(complexity) sameAs Q6953653.
- NE_(complexity) sameAs NE_(complexity).
- NE_(complexity) wasDerivedFrom NE_(complexity)?oldid=543789271.
- NE_(complexity) isPrimaryTopicOf NE_(complexity).