research
∙
07/14/2022
PSPACE-Completeness of Reversible Deterministic Systems
We prove PSPACE-completeness of several reversible, fully deterministic ...
share
research
∙
06/01/2020
Walking through Doors is Hard, even without Staircases: Proving PSPACE-hardness via Planar Assemblies of Door Gadgets
A door gadget has two states and three tunnels that can be traversed by ...
research
∙
03/22/2020
1 x 1 Rush Hour with Fixed Blocks is PSPACE-complete
Consider n^2-1 unit-square blocks in an n × n square board, where each b...
research
∙
02/10/2020
