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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

Model checking is one of the most powerful and widespread tools for system verification with applications in many areas of…

2013

Association rule mining is known to be computationally intensive, yet real-time decision-making applications are increasingly…

2011

In this report we give a formal definition of the sliding block puzzle Rush Hour and we report on the proof showing that Rush…

2011

In ontology-based data access, data are queried through an ontology that offers a representation of the domain of interest. In…

2008

We study complexity issues for interaction systems, a general model for component-based systems that allows for a very flexible…

2004

We prove that a pushing-block puzzle called PUSHPUSH-k is PSPACE-complete for any fixed k ≥ 1. In this puzzle, a robot moves on a…

2003

2001

We propose a formal testing framework for a behavioural subset of UML statechart diagrams (UMLSDs). A formal operational…

1988

We define a notion of πα equivalence of two execution sequences, where π is the set of variables shared between the two sequences…

1986

Graph grammars are systems for the generation of directed, node and edge labeled graphs. They rewrite single nodes only and…