NONELEMENTARY
Wikipedia on Answers.com:
Top
NONELEMENTARY
 |
This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (December 2009) |
In computational complexity theory, the complexity class NONELEMENTARY is the complement of the class ELEMENTARY.
Example decidable problems in NONELEMENTARY this class are:
- the problem of regular expression equivalence with not
- decision problem for monadic second-order logic over trees
- decision problem for term algebras
| P ≟ NP | This theoretical computer science-related article is a stub. You can help Wikipedia by expanding it. |
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
Post a question - any question - to the WikiAnswers community:
Copyrights:
Wikipedia on Answers.com
This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article NONELEMENTARY.
Read more