Results 1  10
of
1,046,639
LengthIncreasing Reductions for PSPACECompleteness
"... Abstract. Polynomialtime manyone reductions provide the standard notion of completeness for complexity classes. However, as first explicated by Berman and Hartmanis in their work on the isomorphism conjecture, all natural complete problems are actually complete under reductions with stronger prope ..."
Abstract
 Add to MetaCart
properties. We study the lengthincreasing property and show under various computational hardness assumptions that all PSPACEcomplete problems are complete via lengthincreasing reductions that are computable with a small amount of nonuniform advice. If there is a problem in PSPACE that requires exponential
Robustness of PSPACEcomplete sets
, 2008
"... We study the robustness of complete languages in PSPACE and prove that they are robust against Pselective sparse sets. Earlier similar results are known for EXPcomplete sets [3] and NPcomplete sets [7]. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the robustness of complete languages in PSPACE and prove that they are robust against Pselective sparse sets. Earlier similar results are known for EXPcomplete sets [3] and NPcomplete sets [7].
Generalized Amazons is PSPACE–Complete
"... Amazons is a perfect information board game with simple rules and large branching factors. Two players alternately move chess queenlike pieces and block squares on a 10×10 playing field. The player who makes the last move wins. Amazons endgames usually decompose into independent subgames. Therefore ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
. Therefore, the game is a natural testbed for combinatorial game theory. It was known that determining the winner of simple generalized Amazons endgames is NPequivalent. This paper presents two proofs for the PSPACEcompleteness of the generalized version of the full game. 1
DAGwidth is PSPACEcomplete
, 2014
"... Berwanger et al. show in [BDH+12] that for every graph G of size n and DAGwidth k there is a DAG decomposition of width k of size nO(k). This gives a polynomial time algorithm for determining the DAGwidth of a graph for any fixed k. However, if the DAGwidth of the graphs from a class is not boun ..."
Bisimilarity of onecounter processes is PSPACEcomplete
"... A onecounter automaton is a pushdown automaton over a singleton stack alphabet. We prove that the bisimilarity of processes generated by nondeterministic onecounter automata (with no εsteps) is in PSPACE. This improves the previously known decidability result (Jančar 2000), and matches the known ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
the known PSPACE lower bound (Srba 2009). We add the PTIMEcompleteness result for deciding regularity (i.e. finiteness up to bisimilarity) of onecounter processes.
The complexity of approximation PSPACEcomplete problems for hierarchical specifications
 Nordic Journal of Computing
, 1994
"... We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specied graphs, many of which are PSPACEcomplete. Assuming P 6 = PSPACE, the existence or nonexistence of such ecient approximation algorithms is characterized, for several standard graph the ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We extend the concept of polynomial time approximation algorithms to apply to problems for hierarchically specied graphs, many of which are PSPACEcomplete. Assuming P 6 = PSPACE, the existence or nonexistence of such ecient approximation algorithms is characterized, for several standard graph
Solutions to realworld instances of PSPACEcomplete stacking
, 2007
"... We investigate a complex stacking problem that stems from storage planning of steel slabs in integrated steel production. Besides the practical importance of such stacking tasks, they are appealing from a theoretical point of view. We show that already a simple version of our stacking problem is PS ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
is PSPACEcomplete. Thus, fast algorithms for computing provably good solutions as they are required for practical purposes raise various algorithmic challenges. We describe an algorithm that computes solutions within 5/4 of optimality for all our realworld test instances. The basic idea is a search
PSPACEcompleteness of Bloxorz and of Games with 2Buttons
"... Abstract. Bloxorz is an online puzzle game where players move a 1 by 1 by 2 block by tilting it on a subset of the two dimensional grid. Bloxorz features switches that open and close trapdoors. The puzzle is to move the block from its initial position to an upright position on the destination square ..."
Abstract
 Add to MetaCart
square. We show that the problem of deciding whether a given Bloxorz level is solvable is PSPACEcomplete and that this remains so even when all trapdoors are initially closed or all trapdoors are initially open. We also answer an open question of Viglietta [5], showing that 2buttons are sufficient
Ladders are PSPACEcomplete
, 2000
"... In the game of Go, the question of whether a laddera method of capturing stonesworks, is shown to be PSPACEcomplete. ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
In the game of Go, the question of whether a laddera method of capturing stonesworks, is shown to be PSPACEcomplete.
Results 1  10
of
1,046,639