The complexity class of decision problems solvable by a deterministic algorithm whose running time grows exponentially with the size of the input, known to strictly contain P by the time hierarchy theorem.
Facts
Core PrincipleThe set of all decision problems solvable by a deterministic Turing machine in exponential time. 1 Connections
Sources
1. EXPTIME, Wikipedia
Lead section, first sentence
the set of all decision problems that are solvable by a deterministic Turing machine in exponential time
In Group: Space, Exponential Time and Probabilistic Classes, Lead
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.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.