In computational complexity theory, the complexity class E L E M E N T A R Y {\displaystyle {\mathsf {ELEMENTARY}}} consists of the decision problems that can be solved in time bounded by an elementary recursive function. Equivalently, these are the problems that can be solved in time bounded by an iterated exponential function with a bounded number of iterations.
In computational complexity theory, the complexity class E L E M E N T A R Y {\displaystyle {\mathsf {ELEMENTARY}}} consists of the decision problems that can be solved in time bounded by an elementary recursive function. Equivalently, these are the problems that can be solved in time bounded by an iterated exponential function with a bounded number of iterations.
Source: Wikipedia "ELEMENTARY" · CC BY-SA 4.0
Share this article: X · Bluesky