EXPTIME
Sign in to saveAlso known as exponential time
In computational complexity theory, the complexity class EXPTIME (sometimes called EXP or DEXPTIME) is the set of all decision problems that are solvable by a deterministic Turing machine in exponential time, i.e., in O(2p(n)) time, where p(n) is a polynomial function of n.
In the Vinony graph
Within Vinony's link graph, EXPTIME is referenced by 117 other articles, and connects out to time complexity, chess and International Standard Book Number.
It is catalogued under the topic Complexity classes.
Its subject is documented across 16 Wikipedia language editions.
~6 min read
Encyclopedic overview
5 sectionsContents
- Formal definition
- Relationships to other classes
- EXPTIME-complete
- Succinct circuits
- References
In computational complexity theory, the complexity class EXPTIME (sometimes called EXP or DEXPTIME) is the set of all decision problems that are solvable by a deterministic Turing machine in exponential time, i.e., in O(2p(n)) time, where p(n) is a polynomial function of n.
EXPTIME is one intuitive class in an exponential hierarchy of complexity classes with increasingly more complex oracles or quantifier alternations. For example, the class 2-EXPTIME is defined similarly to EXPTIME but with a doubly exponential time bound. This can be generalized to higher and higher time bounds.
Excerpted from Wikipedia’s “EXPTIME” article, available under the CC BY-SA 4.0 licence.