Pages that link to "Item:Q2354306"
From MaRDI portal
The following pages link to Packing cubes into a cube is NP-complete in the strong sense (Q2354306):
Displaying 4 items.
- Complexity of one packing optimization problem (Q289799) (← links)
- Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results (Q346495) (← links)
- Packing Cubes into a Cube in (D>3)-Dimensions (Q3196389) (← links)
- Solving the Rubik's Cube Optimally is NP-complete (Q3304120) (← links)