Packing cubes into a cube is NP-complete in the strong sense (Q2354306)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing cubes into a cube is NP-complete in the strong sense |
scientific article |
Statements
Packing cubes into a cube is NP-complete in the strong sense (English)
0 references
10 July 2015
0 references
computational complexity
0 references
packing problems
0 references
cube packing
0 references
bin packing
0 references
NP-completeness
0 references
0 references
