Live briefing
Everything about EXPTIME
Algorithmic complexity class
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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: EXPTIMEA 5-minute orientation
- Skim a recent paper: The Simplest Possible Fully Correct Solution of the Clay Millennium Problem about P vs. NP. A Simple Proof That P ≠ NP = EXPTIMEInfluential work since 2022
- Pick up a classic book: Theories and proof systems for PSPACE and the EXP-time hierarchyThe most-reprinted book on the subject
- Read the landmark paper: Sparse sets in NP-P: EXPTIME versus NEXPTIMECited 74 times
- Go sideways: NEXPTIMEA closely related topic
- Go sideways: Complexity classA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Sparse sets in NP-P: EXPTIME versus NEXPTIME
EXPtime tableaux for ALC
N by N Checkers is Exptime Complete
Cops and Robbers is EXPTIME-complete
ATL Satisfiability is Indeed EXPTIME-complete
Stochastic limit-average games are in EXPTIME
BPA bisimilarity is EXPTIME-hard
Ground reducibility is EXPTIME-complete
🆕 Influential since 2022
📚 Books worth reading
- 📕Theories and proof systems for PSPACE and the EXP-time hierarchyAlan Ramsay Skelley · 2006
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- NEXPTIME In computational complexity theory, the complexity class NEXPTIME (sometimes called NEXP) is the set of decision problems that can be solved by a non-determinis…
- Complexity class In computational complexity theory, a complexity class is a set of computational problems "of related resource-based complexity". The two most commonly…
- PSPACE Unsolved problem in computer science 𝖯=?𝖯𝖲𝖯𝖠𝖢𝖤 More unsolved problems in computer science In computational complexity theory, PSPACE is the set…
- P/poly In computational complexity theory, P/poly is a complexity class that can be defined in both circuit complexity and non-uniform complexity. Since the two…
- Computational complexity theory In theoretical computer science and mathematics, computational complexity theory focuses on classifying computational problems according to their resource…
- P (complexity) In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class. It contains all decision problems that can…
- Polynomial hierarchy In computational complexity theory, the polynomial hierarchy (sometimes called the polynomial-time hierarchy) is a hierarchy of complexity classes that…
- Savitch's theorem In computational complexity theory, Savitch's theorem, proved by Walter Savitch in 1970, gives a relationship between deterministic and non-deterministic…