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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1986-2018
0102019862018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper, we consider termination of probabilistic programs with real-valued variables. The questions concerned are: 1… (More)
  • table 1
  • figure 1
  • figure 4
  • figure 8
  • figure 6
Is this relevant?
2013
2013
In recent years, huge effort has been devoted to the definition of modal logics for strategic reasoning in the setting of multi… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We present Acacia+, a tool for solving the LTL realizability and synthesis problems. We use recent approaches that reduce these… (More)
  • table 1
  • table 2
Is this relevant?
2012
2012
Strategy Logic (SL, for short) has been recently introduced by Mogavero, Murano, and Vardi as a formalism for reasoning… (More)
Is this relevant?
2012
2012
Burkart, Caucal, Steffen (1995) showed a procedure deciding bisimulation equivalence of processes in Basic Process Algebra (BPA… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive… (More)
  • table 1
Is this relevant?
2010
2010
We present a decision procedure for the full branching-time logic CTL∗ which is based on tableaux with global conditions on… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Synthesis is the automated construction of a system from its specification. In the classical temporal synthesis algorithms, it is… (More)
Is this relevant?
2006
2006
The alternating-time temporal logic (ATL) of Alur, Henzinger and Kupferman is being increasingly widely applied in the… (More)
  • figure 1
Is this relevant?
2003
2003
One of the most important reasoning tasks on queries is checking containment, i.e., verifying whether one query yields… (More)
Is this relevant?