Pages that link to "Item:Q672026"
From MaRDI portal
The following pages link to Partitioning a planar assembly into two connected parts is NP-complete (Q672026):
Displaying 4 items.
- Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703) (← links)
- On the complexity of one-shot translational separability. (Q1853067) (← links)
- On the separability of quadrilaterals in the plane by translations and rotations (Q2400117) (← links)
- Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)