Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,434,856 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
31 relations
2-EXPTIME
Algorithm
Alternating Turing machine
Complexity class
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Explorer Simulation Problems Over One-Counter Nets
Piotr Hofman
,
L. Lasota
,
Richard Mayr
,
Patrick Totzke
2016
Corpus ID: 9980412
One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be…
Expand
2016
2016
Runtime verification on data-carrying traces
J. Kuester
2016
Corpus ID: 63660100
Malfunctioning software systems can cause severe loss of money, sensitive data, or even human life. The ambition is therefore to…
Expand
2015
2015
Approximate Comparison of Functions Computed by Distance Automata
Thomas Colcombet
,
L. Daviaud
Theory of Computing Systems
2015
Corpus ID: 253745212
Distance automata are automata weighted over the semiring (ℕ∪{∞},min,+)\documentclass[12pt]{minimal} \usepackage{amsmath…
Expand
2014
2014
Linearizability is EXPSPACE-complete
Jad Hamza
arXiv.org
2014
Corpus ID: 43119207
It was shown in Alur et al. [1] that the problem of verifying finite concurrent systems through Linearizability is in EXPSPACE…
Expand
2013
2013
A New Metric Temporal Logic for Hybrid Systems
Mark Reynolds
Time
2013
Corpus ID: 23665351
We introduce a new way of defining metric temporal logic over the continuous real model of time. The semantics refer to a single…
Expand
2010
2010
Time Versus Space
F. Fomin
,
D. Kratsch
2010
Corpus ID: 116348947
We have already met different types of exponential algorithms. Some of them use only polynomial space, among them in particular…
Expand
2003
2003
Dynamic Combination of Search and Variable Elimination in CSP and Max-CSP
J. Larrosa
,
R. Dechter
2003
Corpus ID: 18869347
Variable elimination is the basic step of Adaptive Consis-tency8]. It transforms the problem into an equivalent one, having one…
Expand
2000
2000
A Technique for Parallel Reachability Analysis of Java Programs
R. Rangarajan
,
S. Iyer
,
G. Sajith
2000
Corpus ID: 19007038
Reachability analysis is a wellknown static analysis tool for the verification of critical properties in concurrent programs and…
Expand
1996
1996
Algorithmes primitifs récursifs et problèmes EXPSPACE-Complets dans les réseaux de Petri cycliques
Z. Bouziane
1996
Corpus ID: 115245573
Nous presentons, dans cette these, des resultats de complexite pour les problemes de verification (l'accessibilite, la couverture…
Expand
1995
1995
Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results
M. Marathe
,
H. Hunt
,
R. Stearns
,
V. Radhakrishnan
Satisfiability Problem: Theory and Applications
1995
Corpus ID: 18134369
We study the complexity of various combinatorial and satisfiability problems when instances are specified using one of the…
Expand
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)
ACCEPT & CONTINUE