Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6954914> ?p ?o }
Showing triples 1 to 10 of
10
with 100 triples per page.
- Q6954914 subject Q7298553.
- Q6954914 abstract "In computational complexity theory, a nonelementary problem is a problem that is not a member of the class ELEMENTARY.Examples of nonelementary problems that are nevertheless decidable include: the problem of regular expression equivalence with complementation decision problem for monadic second-order logic over trees decision problem for term algebras↑ ↑ ↑ ↑".
- Q6954914 wikiPageWikiLink Q1548746.
- Q6954914 wikiPageWikiLink Q185612.
- Q6954914 wikiPageWikiLink Q205084.
- Q6954914 wikiPageWikiLink Q21998744.
- Q6954914 wikiPageWikiLink Q5323278.
- Q6954914 wikiPageWikiLink Q7298553.
- Q6954914 comment "In computational complexity theory, a nonelementary problem is a problem that is not a member of the class ELEMENTARY.Examples of nonelementary problems that are nevertheless decidable include: the problem of regular expression equivalence with complementation decision problem for monadic second-order logic over trees decision problem for term algebras↑ ↑ ↑ ↑".
- Q6954914 label "Nonelementary problem".