scientific article; zbMATH DE number 3883607
From MaRDI portal
Publication:3217599
zbMATH Open0554.68027MaRDI QIDQ3217599FDOQ3217599
Authors: Thomas Ottmann, Eljas Soisalon-Soininen, Bernard Chazelle, D. Wood 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
- On the complexity of one-shot translational separability.
- Pushing blocks is hard.
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- \(1\times 1\) Rush Hour with fixed blocks is PSPACE-complete
- scientific article; zbMATH DE number 4121493
Cited In (12)
- On the complexity of one-shot translational separability.
- Representing orders on the plane by translating convex figures
- Solving visibility and separability problems on a mesh-of-processors
- An optimal algorithm for one-separation of a set of isothetic polygons
- Separation of NP-completeness notions
- Detecting geometric infeasibility
- Translation separability of sets of polygons
- Title not available (Why is that?)
- Partitioning and separating sets of orthogonal polygons
- Convex blocking and partial orders on the plane
- On the separability of quadrilaterals in the plane by translations and rotations
- On Reconfiguration of Disks in the Plane and Related Problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217599)
