Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,008,263 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Alternating Turing machine
Complexity class
Computational complexity theory
DTIME
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Strategic Reasoning in Game Theory
Vadim Malvone
2018
Corpus ID: 196186447
Game theory in AI is a powerful mathematical framework largely applied in the last three decades for the strategic reasoning in…
Expand
2017
2017
Liveness Verification and Synthesis: New Algorithms for Recursive Programs
R. Meyer
,
Sebastian Muskalla
,
Elisabeth Neumann
arXiv.org
2017
Corpus ID: 17498846
We consider the problems of liveness verification and liveness synthesis for recursive programs. The liveness verification…
Expand
2015
2015
F eb 2 01 5 The Complexity of Synthesis from Probabilistic Components ∗
2015
Corpus ID: 52997835
The synthesis problem asks for the automatic construction o f a system from its specification. In the traditional setting, the…
Expand
2014
2014
Revisiting the Hardness of Query Answering in Expressive Description Logics
Magdalena Ortiz
,
M. Šimkus
International Conference on Web Reasoning and…
2014
Corpus ID: 41998773
Answering conjunctive queries over Description Logic (DL) knowledge bases is known to be 2ExpTime-hard for the DLs \(\mathcal…
Expand
2014
2014
Complexity of Conservative Extensions and Inseparability in the Description Logic EL^\lnot
Yuming Shen
,
Ju Wang
China Semantic Web Symposium
2014
Corpus ID: 26304745
The notations of conservative extensions and inseparability are suggested as the effective tool for comparing, merging, and…
Expand
2012
2012
A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems
Kshitij Bansal
,
Stephane Demri
arXiv.org
2012
Corpus ID: 11001871
In this note, we provide complexity characterizations of model checking multi-pushdown systems. Multi-pushdown systems model re…
Expand
2008
2008
Satisfying a Fragment of XQuery by Branching-Time Reduction
Sylvain Hallé
,
Roger Villemaire
Time
2008
Corpus ID: 12648147
Configuration logic (CL) is a fragment of XQuery that allows first-order quantification over node labels. In this paper, we study…
Expand
2007
2007
Hybrid Branching-Time Logics
Volker Weber
arXiv.org
2007
Corpus ID: 9344022
Hybrid branching-time logics are introduced as extensions of CTL-like logics with state variables and the downarrow-binder…
Expand
2006
2006
Data Complexity of Query Answering in Expressive Description Logics with Nominals Data Complexity of Query Answering in Expressive Description Logics with Nominals
Magdalena Ortiz
,
Diego Calvanese
,
Thomas Eiter
2006
Corpus ID: 15713725
The formal foundations of the standard web ontology languages, OWL-Lite and OWLDL, are provided by expressive Description Logics…
Expand
2001
2001
Reasoning over Conceptual Schemas and Queries in Temporal Databases
A. Artale
,
Enrico Franconi
,
Milenko Mosurovic
,
F. Wolter
,
M. Zakharyaschev
Sistemi Evoluti per Basi di Dati
2001
Corpus ID: 15742056
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the…
Expand