search result

Cover von Toward a General Complexity Theory of Motion Planning

Toward a General Complexity Theory of Motion Planning

Characterizing Which Gadgets Make Games Hard
Year: 2020
Media group: LIPIcs
Cover von Complexity of Motion Planning of Arbitrarily Many Robots

Complexity of Motion Planning of Arbitrarily Many Robots

Gadgets, Petri Nets, and Counter Machines
Author: Hendrickson, Dylan H.; Lynch, Jayson
Year: 2023
Media group: LIPIcs
Cover von Lower Bounds on Retroactive Data Structures

Lower Bounds on Retroactive Data Structures

Year: 2022
Media group: LIPIcs
Cover von Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles

Flat Folding an Unassigned Single-Vertex Complex (Combinatorially Embedded Planar Graph with Specified Edge Lengths) Without Flat Angles

Year: 2022
Media group: LIPIcs
Cover von Pushing Blocks via Checkable Gadgets

Pushing Blocks via Checkable Gadgets

PSPACE-Completeness of Push-1F and Block/Box Dude
Author: Lynch, Jayson
Year: 2022
Media group: LIPIcs
Cover von Complexity of Retrograde and Helpmate Chess Problems

Complexity of Retrograde and Helpmate Chess Problems

Even Cooperative Chess Is Hard
Year: 2020
Media group: LIPIcs
Cover von Walking Through Doors Is Hard, Even Without Staircases

Walking Through Doors Is Hard, Even Without Staircases

Proving PSPACE-Hardness via Planar Assemblies of Door Gadgets
Author: Lynch, Jayson
Year: 2020
Media group: LIPIcs
Cover von 1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete

1 X 1 Rush Hour with Fixed Blocks Is PSPACE-Complete

Author: Suhl, Adam; Zeff, Avi
Year: 2020
Media group: LIPIcs
Cover von Characterizing Universal Reconfigurability of Modular Pivoting Robots

Characterizing Universal Reconfigurability of Modular Pivoting Robots

Author: Korman, Matias; Korten, Oliver; Lynch, Jayson
Year: 2021
Media group: LIPIcs
OPEN V 11.1.0.0