Exponential hierarchy
|
|
In computational complexity theory, the exponential hierarchy is a hierarchy of complexity classes, starting with EXP:
- <math>\rm{EXP} = \bigcup_{k\in\mathbb{N}} \mbox{DTIME}(2^{n^k})<math>
and continuing with
- <math>\rm{2EXP} = \bigcup_{k\in\mathbb{N}} \mbox{DTIME}(2^{2^{n^k}})<math>
- <math>\rm{3EXP} = \bigcup_{k\in\mathbb{N}} \mbox{DTIME}(2^{2^{2^{n^k}}})<math>
and so on.
We have P ⊂ EXP ⊂ 2EXP ⊂ 3EXP ⊂ …. Unlike the analogous case for the polynomial hierarchy, the time hierarchy theorem guarantees that these inclusions are proper: that is, there are languages in EXP but not in P, in 2EXP but not in EXP and so on.
The union of all the classes in the exponential hierararchy is the class ELEMENTARY.