scientific article; zbMATH DE number 7650410

DOI10.4230/LIPIcs.ITCS.2020.62MaRDI QIDQ5875768

Erik D. Demaine, Jayson Lynch, Dylan Hendrickson

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1812.03592

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

zbMATH Keywords

computational complexityundecidabilitymotion planninggamesPSPACEEXPNPNEXP

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (6)

Traversability, reconfiguration, and reachability in the gadget framework ⋮ Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets ⋮ Unnamed Item ⋮ Traversability, reconfiguration, and reachability in the gadget framework ⋮ Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets ⋮ PSPACE-completeness of reversible deterministic systems

This page was built for publication: