Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/E_(complexity)> ?p ?o }
Showing triples 1 to 39 of
39
with 100 triples 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) wikiPageLength "1691".
- E_(complexity) wikiPageOutDegree "12".
- E_(complexity) wikiPageRevisionID "644408988".
- E_(complexity) wikiPageWikiLink Big_O_notation.
- E_(complexity) wikiPageWikiLink Category:Complexity_classes.
- E_(complexity) wikiPageWikiLink Complexity_class.
- E_(complexity) wikiPageWikiLink Computational_complexity_theory.
- E_(complexity) wikiPageWikiLink DTIME.
- E_(complexity) wikiPageWikiLink Decision_problem.
- E_(complexity) wikiPageWikiLink Deterministic_Turing_machine.
- E_(complexity) wikiPageWikiLink EXPTIME.
- E_(complexity) wikiPageWikiLink Polynomial-time_many-one_reduction.
- E_(complexity) wikiPageWikiLink Polynomial-time_reduction.
- E_(complexity) wikiPageWikiLink SIAM_Journal_on_Computing.
- E_(complexity) wikiPageWikiLink Symposium_on_Foundations_of_Computer_Science.
- E_(complexity) wikiPageWikiLink Turing_machine.
- E_(complexity) wikiPageWikiLinkText "E (complexity)".
- E_(complexity) wikiPageWikiLinkText "E".
- E_(complexity) hasPhotoCollection E_(complexity).
- E_(complexity) wikiPageUsesTemplate Template:CZoo.
- E_(complexity) wikiPageUsesTemplate Template:Citation.
- E_(complexity) wikiPageUsesTemplate Template:Comp-sci-theory-stub.
- E_(complexity) subject Category:Complexity_classes.
- E_(complexity) hypernym Set.
- 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 (complexity)".
- 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_(複雜度).
- E_(complexity) wasDerivedFrom E_(complexity)?oldid=644408988.
- E_(complexity) isPrimaryTopicOf E_(complexity).