PSPACE-completeness of an escape problem

DOI10.1016/J.IPL.2008.05.011zbMATH Open1191.68345OpenAlexW2006037131MaRDI QIDQ975459FDOQ975459

Authors Y. Takenaga, Shigeru Arai

Publication date 9 June 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2008.05.011

zbMATH Keywords

computational complexitypuzzlePSPACE-completenessrogue

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites work

• GO Is Polynomial-Space Hard
• On Embedding a Graph in the Grid with the Minimum Number of Bends

This page was built for publication: PSPACE-completeness of an escape problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975459)