Pages that link to "Item:Q3305736"
From MaRDI portal
The following pages link to Computational complexity of motion planning of a robot through simple gadgets (Q3305736):
Displaying 11 items.
- Motion planning with pulley, rope, and baskets (Q385498) (← links)
- PSPACE-completeness of reversible deterministic systems (Q2104136) (← links)
- Traversability, reconfiguration, and reachability in the gadget framework (Q2154080) (← links)
- Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets (Q2154096) (← links)
- Motion planning with pulley, rope, and baskets (Q2904777) (← links)
- The Parameterized Complexity of Motion Planning for Snake-Like Robots (Q5130004) (← links)
- Recursed Is Not Recursive: A Jarring Result (Q6065458) (← links)
- Traversability, reconfiguration, and reachability in the gadget framework (Q6090541) (← links)
- Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets (Q6165551) (← links)
- Walking through doors is hard, even without staircases: proving PSPACE-hardness via planar assemblies of door gadgets (Q6487567) (← links)
- Defying gravity and gadget numerosity: the complexity of the Hanano puzzle and beyond (Q6602331) (← links)