Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography (Q2902905)
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 6070042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography |
scientific article; zbMATH DE number 6070042 |
Statements
22 August 2012
0 references
discrete tomography
0 references
2-atom problem
0 references
tiling
0 references
NP-complete
0 references
Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography (English)
0 references
0.942944347858429
0 references
0.7977246642112732
0 references
0.7906259298324585
0 references
0.7832329273223877
0 references
0.7831475138664246
0 references
