pdf-format: |
|
@InProceedings{brunner_et_al:LIPIcs:2020:12768, author = {Josh Brunner and Lily Chung and Erik D. Demaine and Dylan Hendrickson and Adam Hesterberg and Adam Suhl and Avi Zeff}, title = {{1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete}}, booktitle = {10th International Conference on Fun with Algorithms (FUN 2021)}, pages = {7:1--7:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-145-0}, ISSN = {1868-8969}, year = {2020}, volume = {157}, editor = {Martin Farach-Colton and Giuseppe Prencipe and Ryuhei Uehara}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12768}, URN = {urn:nbn:de:0030-drops-127681}, doi = {10.4230/LIPIcs.FUN.2021.7}, annote = {Keywords: puzzles, sliding blocks, PSPACE-hardness} }
Keywords: | puzzles, sliding blocks, PSPACE-hardness | |
Seminar: | 10th International Conference on Fun with Algorithms (FUN 2021) | |
Issue date: | 2020 | |
Date of publication: | 16.09.2020 |