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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Power is a RISC architecture developed by IBM, Freescale, and several other companies and implemented in a series of POWER… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
In a rolling block maze, one or more blocks lie on a rectangular board with square cells. In most mazes, the blocks have size k… (More)
  • figure 1
  • figure 2
Is this relevant?
2006
2006
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
We prove PSPACE-completeness of a class of pushingblock puzzles similar to the classic Sokoban, extending several previous… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 8
Is this relevant?
2000
2000
In the game of Go, the question of whether a ladder—a method of capturing stones—works, is shown to be PSPACE-complete. Our… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
It is shown that the popular puzzle Sokoban can be used to emulate a linear bounded automata ((nite tape Turing Machine (TM)). In… (More)
  • figure 9
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We give a PSPACE algorithm for determining the signs of multivariate polynomials at the common zeros of a system of polynomial… (More)
Is this relevant?