 2-EXPTIME

In computational complexity theory, the complexity class 2-EXPTIME (sometimes called 2-EXP) is the set of all decision problems solvable by a deterministic Turing machine in O(22"p"("n")) time, where "p"("n") is a polynomial function of "n".In terms of DTIME,

We know

2-EXPTIME can also be reformulated as the space class AEXPSPACE, the problems that can be solved by an alternating Turing machine in exponential space.