Packing cubes into a cube is NP-complete in the strong sense (Q2354306)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6457766
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing cubes into a cube is NP-complete in the strong sense |
scientific article; zbMATH DE number 6457766 |
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
0.9830430150032043
0 references
0.9448283314704896
0 references
0.7787002921104431
0 references
0.773353636264801
0 references
0.7650225162506104
0 references
