Information | |
---|---|
has gloss | eng: In computational complexity theory, the complexity class ELEMENTARY of elementary recursive functions is the union of the classes in the exponential hierarchy. |
lexicalization | eng: ELEMENTARY |
instance of | e/Complexity class |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint