Skip to search formSkip to main contentSkip to account menu

2-EXPTIME

Known as: 2-EXP, 2EXPTIME 
In computational complexity theory, the complexity class 2-EXPTIME (sometimes called 2-EXP) is the set of all decision problems solvable by a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Alternating Turing machineComplexity classComputational complexity theoryDTIME

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Complexity of Projection with Stochastic Actions in a Probabilistic Description Logic
We consider an action language extended with quantitative notions of uncertainty. In our setting, the initial beliefs of an agent… 
2016
2016
Query-Based Entailment and Inseparability for ALC Ontologies
We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a given vocabulary. We give… 
2011
2011
The Complexity of Quantitative Information Flow Problems
In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic… 
2009
2009
Branching-Time Logics Repeatedly Referring to States
While classical temporal logics lose track of a state as soon as a temporal operator is applied, several branching-time logics… 
2009
2009
A 2EXPTIME Complete Varietal Membership Problem
  • M. Kozik
  • SIAM journal on computing (Print)
  • 2009
  • Corpus ID: 487632
We construct a finite algebra generating a variety with 2EXPTIME complete membership problem. This proves that the universal… 
2007
2007
Hybrid Branching-Time Logics
Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder… 
2007
2007
On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
The guarded fragment of first-order logic, GF, enjoys the finite model property, so the satisfiability and the finite… 
2004
2004
Weak Bisimilarity and Regularity of Context-Free Processes is EXPTIME-hard
2003
2003
Playing Games with Boxes and Diamonds
Deciding infinite two-player games on finite graphs with the winning condition specified by a linear temporal logic (Ltl) formula… 
Highly Cited
2003
Highly Cited
2003
Decidable containment of recursive queries
One of the most important reasoning tasks on queries is checking containment, i.e., verifying whether one query yields… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)