Tile-packing tomography is \(\mathbb{NP}\)-hard (Q1759658)
From MaRDI portal
!
WARNING
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 6109320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tile-packing tomography is \(\mathbb{NP}\)-hard |
scientific article; zbMATH DE number 6109320 |
Statements
Tile-packing tomography is \(\mathbb{NP}\)-hard (English)
0 references
21 November 2012
0 references
tilings
0 references
discrete tomography
0 references
\(\mathbb{NP}\)-hardness
0 references
affine independence
0 references
0.9970342516899108
0 references
0.8914263248443604
0 references
0.8257423043251038
0 references
0.7975982427597046
0 references
