Pages that link to "Item:Q1313730"
From MaRDI portal
The following pages link to On the complexity of assembly partitioning (Q1313730):
Displaying 5 items.
- Partitioning a planar assembly into two connected parts is NP-complete (Q672026) (← links)
- Minimal fixturing of frictionless assemblies: Complexity and algorithms (Q1364358) (← links)
- On the complexity of one-shot translational separability. (Q1853067) (← links)
- Symmetric assembly puzzles are hard, beyond a few pieces (Q2206733) (← links)
- Intractability of assembly sequencing: Unit disks in the plane (Q5096948) (← links)