Tile-packing tomography is \(\mathbb{NP}\)-hard (Q1759658): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:57, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tile-packing tomography is \(\mathbb{NP}\)-hard |
scientific article |
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
