Home /Research /PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
OTHER

PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation

Robert A. Hearn, Erik D. Demaine

Year
2005
Citations
317

Keywords

PSPACENondeterministic algorithmMathematicsModel of computationCompleteness (order theory)Complexity classVertex (graph theory)ComputationDiscrete mathematicsConstraint satisfaction problem

Related papers

Browse all OTHER papers