Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,519,489 papers from all fields of science
Search
Sign In
Create Free Account
PSPACE-complete
Known as:
PSPACE complete
In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Atomix
Boolean satisfiability problem
Canadian traveller problem
Col (game)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
PARAS: A Parameter Space Framework for Online Association Mining
Xika Lin
,
Abhishek Mukherji
,
Elke A. Rundensteiner
,
Carolina Ruiz
,
M. Ward
Proceedings of the VLDB Endowment
2013
Corpus ID: 8765873
Association rule mining is known to be computationally intensive, yet real-time decision-making applications are increasingly…
Expand
2013
2013
Towards an Abstract Framework for Compliance
Silvano Colombo Tosatto
,
Guido Governatori
,
Pierre Kelsen
17th IEEE International Enterprise Distributed…
2013
Corpus ID: 14334775
The present paper aims at providing an abstract framework to define the regulatory compliance problem. In particular we show how…
Expand
2011
2011
Rush Hour is PSPACE-complete
J. V. Rijn
2011
Corpus ID: 30589131
In this report we give a formal definition of the sliding block puzzle Rush Hour and we report on the proof showing that Rush…
Expand
Review
2010
Review
2010
Temporal Conceptual Modelling with DL-Lite
A. Artale
,
R. Kontchakov
,
V. Ryzhikov
,
M. Zakharyaschev
Description Logics
2010
Corpus ID: 9860438
Conceptual modelling formalisms such as the Entity-Relationship model (ER) and Unified Modelling Language (UML) have become a de…
Expand
2007
2007
Graph Isomorphism is PSPACE-complete
Matthew Delacorte
arXiv.org
2007
Corpus ID: 26375201
Combining the the results of A.R. Meyer and L.J. Stockmeyer "The Equivalence Problem for Regular Expressions with Squaring…
Expand
2005
2005
On the Hardness of Simple Stochastic Games
Brendan Juba
2005
Corpus ID: 45589737
We examine the problem of finding optimal strategies in simple stochastic games, and the equivalent problem of finding stable…
Expand
2003
2003
Toolkits for the automatic construction of data flow analyzers
J. Lasseter
2003
Corpus ID: 10613372
A camera for perforated roll film includes a transport mechanism for advancing film along an exposure plane, a metering lever…
Expand
2001
2001
A formal testing framework for UML statechart diagrams behaviours: from theory to automatic verification
D. Latella
,
M. Massink
Proceedings Sixth IEEE International Symposium on…
2001
Corpus ID: 907999
We propose a formal testing framework for a behavioural subset of UML statechart diagrams (UMLSDs). A formal operational…
Expand
1989
1989
Formal analysis of real-time equational rule-based systems
A. Mok
[] Proceedings. Real-Time Systems Symposium
1989
Corpus ID: 42314117
A study is made of the real-time performance of a class of rule-based programs written in the language EQL. Response time is…
Expand
1986
1986
On Partially Ordered Graph Grammars
F. Brandenburg
Graph-Grammars and Their Application to Computer…
1986
Corpus ID: 36316594
Graph grammars are systems for the generation of directed, node and edge labeled graphs. They rewrite single nodes only and…
Expand