首页 /研究 /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

发表年份
2005
引用次数
317

关键词

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

相关论文

查看 OTHER 分类全部论文