scientific article; zbMATH DE number 7829459

MaRDI QIDQ6126493

No author found.

Publication date: 9 April 2024

Full work available at URL: https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/1545

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitymotion planning\textsf{PSPACE}-complete

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• \textsc{Snowman} is \(\mathsf{PSPACE}\)-complete
• Generalized Pete's Pike is PSPACE-complete
• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants
• \(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete

This page was built for publication: