Matches in DBpedia 2014 for { <http://dbpedia.org/resource/E_(complexity)> ?p ?o. }
Showing items 1 to 28 of
28
with 100 items per page.
- E_(complexity) abstract "In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time 2O(n) and is therefore equal to the complexity class DTIME(2O(n)).E, unlike the similar class EXPTIME, is not closed under polynomial-time many-one reductions.".
- E_(complexity) wikiPageExternalLink 94-18.html.
- E_(complexity) wikiPageID "663674".
- E_(complexity) wikiPageRevisionID "541185833".
- E_(complexity) hasPhotoCollection E_(complexity).
- E_(complexity) subject Category:Complexity_classes.
- E_(complexity) type Abstraction100002137.
- E_(complexity) type Class107997703.
- E_(complexity) type Collection107951464.
- E_(complexity) type ComplexityClasses.
- E_(complexity) type Group100031264.
- E_(complexity) comment "In computational complexity theory, the complexity class E is the set of decision problems that can be solved by a deterministic Turing machine in time 2O(n) and is therefore equal to the complexity class DTIME(2O(n)).E, unlike the similar class EXPTIME, is not closed under polynomial-time many-one reductions.".
- E_(complexity) label "E (Komplexitätsklasse)".
- E_(complexity) label "E (clase de complejidad)".
- E_(complexity) label "E (complessità)".
- E_(complexity) label "E (complexity)".
- E_(complexity) label "E (複雜度)".
- E_(complexity) label "E (計算複雑性理論)".
- E_(complexity) sameAs E_(Komplexitätsklasse).
- E_(complexity) sameAs E_(clase_de_complejidad).
- E_(complexity) sameAs E_(complessità).
- E_(complexity) sameAs E_(計算複雑性理論).
- E_(complexity) sameAs m.030wjz.
- E_(complexity) sameAs Q1276623.
- E_(complexity) sameAs Q1276623.
- E_(complexity) sameAs E_(complexity).
- E_(complexity) wasDerivedFrom E_(complexity)?oldid=541185833.
- E_(complexity) isPrimaryTopicOf E_(complexity).