Matches in DBpedia 2014 for { <http://dbpedia.org/resource/NONELEMENTARY> ?p ?o. }
Showing items 1 to 20 of
20
with 100 items per page.
- NONELEMENTARY abstract "In computational complexity theory, the complexity class NONELEMENTARY is the complement of the class ELEMENTARY.Example decidable problems in NONELEMENTARY are: the problem of regular expression equivalence with not decision problem for monadic second-order logic over trees decision problem for term algebras".
- NONELEMENTARY wikiPageID "2284654".
- NONELEMENTARY wikiPageRevisionID "574813769".
- NONELEMENTARY auto "yes".
- NONELEMENTARY date "December 2009".
- NONELEMENTARY hasPhotoCollection NONELEMENTARY.
- NONELEMENTARY subject Category:Complexity_classes.
- NONELEMENTARY type Abstraction100002137.
- NONELEMENTARY type Class107997703.
- NONELEMENTARY type Collection107951464.
- NONELEMENTARY type ComplexityClasses.
- NONELEMENTARY type Group100031264.
- NONELEMENTARY comment "In computational complexity theory, the complexity class NONELEMENTARY is the complement of the class ELEMENTARY.Example decidable problems in NONELEMENTARY are: the problem of regular expression equivalence with not decision problem for monadic second-order logic over trees decision problem for term algebras".
- NONELEMENTARY label "NONELEMENTARY".
- NONELEMENTARY sameAs m.070w35.
- NONELEMENTARY sameAs Q6954914.
- NONELEMENTARY sameAs Q6954914.
- NONELEMENTARY sameAs NONELEMENTARY.
- NONELEMENTARY wasDerivedFrom NONELEMENTARY?oldid=574813769.
- NONELEMENTARY isPrimaryTopicOf NONELEMENTARY.