No. Title Author Year
1 Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles Chung, Lily et al. 2022
2 Pushing Blocks via Checkable Gadgets: PSPACE-Completeness of Push-1F and Block/Box Dude Ani, Joshua et al. 2022
3 Characterizing Universal Reconfigurability of Modular Pivoting Robots A. Akitaya, Hugo et al. 2021
4 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete Brunner, Josh et al. 2020
5 Complexity of Retrograde and Helpmate Chess Problems: Even Cooperative Chess Is Hard Brunner, Josh et al. 2020
6 Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard Demaine, Erik D. et al. 2020
7 Walking Through Doors Is Hard, Even Without Staircases: Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets Ani, Joshua et al. 2020
Current Page :
Number of result pages: 1
Number of documents: 7


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI