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.
~3 min read
Article
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) .
Connections
International Standard Book Number
Entity
set
Entity
Wayback Machine
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
polynomial
Entity
Turing machine
Entity
regular expression
Entity
JSTOR
Organization
Q118398
Entity
complement
Entity
big O notation
Entity
computational complexity theory
Entity
Q22908627
Entity
Michael O. Rabin
Entity
NP
Entity
NP-complete
Entity
decision problem
Entity
P
Entity
NP-hard
Entity