Traversability, reconfiguration, and reachability in the gadget framework

DOI10.1007/978-3-030-96731-4_5OpenAlexW4226108859MaRDI QIDQ2154080

Erik D. Demaine, Yevhenii Diomidov, Jayson Lynch, Dylan Hendrickson, Joshua Ani

Publication date: 13 July 2022

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Traversability, reconfiguration, and reachability in the gadget framework

Cites Work

• PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
• Nondeterministic Space is Closed under Complementation
• Full Tilt: Universal Constructors for General Shapes with Uniform External Forces
• Unnamed Item
• Unnamed Item

This page was built for publication: Traversability, reconfiguration, and reachability in the gadget framework