e/2-EXPTIME

Information
has gloss	eng: 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(22p(n)) time, where p(n) is a polynomial function of n.
lexicalization	eng: 2-EXPTIME
instance of	e/Complexity class