论文信息 - The Complexity of the Compaction Problem - 字舞流文

The Complexity of the Compaction Problem

Zhenyu Li | Victor J. Milenkovic | V. Milenkovic | Zhenyu Li

[1] Zhenyu Li,et al. A compaction algorithm for non-convex polygons and its application , 1993, SCG '93.

[2] J. Schwartz,et al. On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

[3] Paul G. Spirakis,et al. Strong NP-Hardness of Moving Many Discs , 1984, Inf. Process. Lett..

[4] Bernard Chazelle,et al. The Complexity and Decidability of Separation , 1984, ICALP.

[5] E. J.,et al. ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .