Surf Wiki
Save to docs
general/complexity-classes

From Surf Wiki (app.surf) — the open knowledge base

2-EXPTIME

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) .

Comparison with other complexity classes

We know

:P ⊆ NP ⊆ PSPACE ⊆ EXPTIME ⊆ NEXPTIME ⊆ EXPSPACE ⊆ 2-EXPTIME ⊆ ELEMENTARY.

2-EXPTIME can also be reformulated as the space class AEXPSPACE, the problems that can be solved by an alternating Turing machine in exponential space. This is one way to see that EXPSPACE ⊆ 2-EXPTIME, since an alternating Turing machine is at least as powerful as a deterministic Turing machine.

2-EXPTIME is one class in a hierarchy of complexity classes with increasingly higher time bounds. The class 3-EXPTIME is defined similarly to 2-EXPTIME but with a triply exponential time bound 2^{2^{2^{n^k}}}. This can be generalized to higher and higher time bounds.

Examples

Examples of algorithms that require at least double-exponential time include:

  • Each decision procedure for Presburger arithmetic provably requires at least doubly exponential time
  • Computing a Gröbner basis over a field. In the worst case, a Gröbner basis may have a number of elements which is doubly exponential in the number of variables. On the other hand, the worst-case complexity of Gröbner basis algorithms is doubly exponential in the number of variables as well as in the entry size.
  • Finding a complete set of associative-commutative unifiers{{citation | url-access = subscription
  • Quantifier elimination on real closed fields takes doubly exponential time (see Cylindrical algebraic decomposition). Thus, deciding whether a first-order formula over the real numbers is in 2-EXPTIME. But it was shown to be EXPSPACE and was conjectured to be EXPSPACE-complete in 1986.
  • Calculating the complement of a regular expression{{cite conference | book-title = Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008)

2-EXPTIME-complete problems

Logic

The satisfiability problem for CTL+ (Computation tree logic) is 2-EXPTIME-complete. The satisfiability problem of ATL* (alternating-time temporal logic) is 2-EXPTIME-complete.

Implicational Relevance Logic is 2-EXPTIME-complete.

The satisfiability problem for propositional dynamic logic with intersection (IPDL) is 2-EXPTIME-complete.

Planning

Generalizations of many fully observable games are EXPTIME-complete. These games can be viewed as particular instances of a class of transition systems defined in terms of a set of state variables and actions/events that change the values of the state variables, together with the question of whether a winning strategy exists. A generalization of this class of fully observable problems to partially observable problems lifts the complexity from EXPTIME-complete to 2-EXPTIME-complete.

Synthesis

LTL (linear temporal logic) synthesis (deciding whether a reactive module satisfying an LTL specification) is 2EXPTIME-complete.

References

References

  1. [[Christos Papadimitriou]], Computational Complexity (1994), {{isbn. 978-0-201-53082-7. Section 20.1, corollary 3, page 495.
  2. [[Michael J. Fischer. Fischer, M. J.]], and [[Michael O. Rabin]], 1974, "[http://www.lcs.mit.edu/publications/pubs/ps/MIT-LCS-TM-043.ps "Super-Exponential Complexity of Presburger Arithmetic.] {{Webarchive. link. (2006-09-15 " ''Proceedings of the SIAM-AMS Symposium in Applied Mathematics Vol. 7'': 27–41)
  3. (August 1990). "The Structure of Polynomial Ideals and Gröbner Bases". [[SIAM Journal on Computing]].
  4. (1986-04-01). "The complexity of elementary algebra and geometry". Journal of Computer and System Sciences.
  5. (2003). "Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003)". Springer-Verlag.
  6. Schewe, Sven. (2008). "Automata, Languages and Programming". Springer.
  7. Schmitz, Sylvain. (2016). "Implicational Relevance Logic Is 2-Exptime-Complete". The Journal of Symbolic Logic.
  8. (2005). "2-Exptime Lower Bounds for Propositional Dynamic Logics with Intersection". The Journal of Symbolic Logic.
  9. Jussi Rintanen. (2004). "Complexity of Planning with Partial Observability". AAAI Press.
  10. (1989-01-03). "Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89". Association for Computing Machinery.
Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

complexity-classes
Want to explore this topic further?

Ask Mako anything about 2-EXPTIME — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report