Skip to search formSkip to main contentSkip to account menu

EXPSPACE

Known as: NEXPSPACE 
In complexity theory, 'EXPSPACE' is the set of all decision problems solvable by a deterministic Turing machine in O(2p(n)) space, where p(n) is a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

31 relations
2-EXPTIMEAlgorithmAlternating Turing machineComplexity class

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Model Checking Well-Behaved Fragments of HS: The (Almost) Final Picture
Model checking is one of the most powerful and widespread tools for system verification with applications in many areas of… 
2016
2016
Runtime verification on data-carrying traces
Malfunctioning software systems can cause severe loss of money, sensitive data, or even human life. The ambition is therefore to… 
2015
2015
A Moderately Exponential Time Algorithm for k-IBDD Satisfiability
We present a satisfiability algorithm for k-indexed binary decision diagrams (k-IBDDs). The proposed exponential space and… 
2013
2013
A New Metric Temporal Logic for Hybrid Systems
We introduce a new way of defining metric temporal logic over the continuous real model of time. The semantics refer to a single… 
2013
2013
Almost-linear inclusion for XML regular expression types
Type inclusion is a fundamental operation in every type-checking compiler, but it is quite expensive for XML manipulation… 
2010
2010
Optical solution for hard on average #P-complete instances (using exponential space for solving instances of the permanent)
Optical architectures that use exponential space for solving instances of the (non-necessarily-binary) permanent are presented… 
Highly Cited
2007
Highly Cited
2007
An Optimal Decision Procedure for Right Propositional Neighborhood Logic
Propositional interval temporal logics are quite expressive temporal logics that allow one to naturally express statements that… 
2005
2005
A Tableau-Based Decision Procedure for Right Propositional Neighborhood Logic
Propositional interval temporal logics are quite expressive temporal logics that allow one to naturally express statements that… 
2002
2002
EXPSPACE-Complete Variant of Guarded Fragment with Transitivity
We introduce a new fragment GF2 + TG of the first order logic - the two-variable guarded fragment with one-way transitive guards… 
1995
1995
Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results
We study the complexity of various combinatorial and satisfiability problems when instances are specified using one of the… 
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)