2-EXPTIME
Sign in to saveIn computational complexity theory, the complexity class 2-EXPTIME (sometimes called 2-EXP, sometimes also written 2EXPTIME) 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.
In the Vinony graph
Vinony's link graph records 82 inbound references to 2-EXPTIME, and connects out to International Standard Book Number, set and Wayback Machine.
It is catalogued under the topic Complexity classes.
Vinony links it to 5 Wikipedia language editions.
~3 min read
Encyclopedic overview
8 sectionsContents
- Comparison with other complexity classes
- Examples
- 2-EXPTIME-complete problems
- Logic
- Planning
- Synthesis
- See also
- References
In computational complexity theory, the complexity class 2-EXPTIME (sometimes called 2-EXP, sometimes also written 2EXPTIME) 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.
In terms of DTIME, \mathsf{2\mbox{-}EXPTIME} = \bigcup_{k \in \mathbb{N} } \mathsf{ DTIME } \left( 2^{ 2^{n^k} } \right) .
Excerpted from Wikipedia’s “2-EXPTIME” article, available under the CC BY-SA 4.0 licence.