Science Fair Project Encyclopedia
ELEMENTARY
In computational complexity theory, the complexity class ELEMENTARY is the union of the classes in the exponential hierarchy.
The name was coined in the context of recursive functions and undecidability; most problems in it are far from elementary!
Some natural recursive problems lie outside ELEMENTARY, for example the problem of regular expression equivalence with not .
12-19-2008 14:25:18
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


