Pages that link to "Item:Q1759658"
From MaRDI portal
The following pages link to Tile-packing tomography is \(\mathbb{NP}\)-hard (Q1759658):
Displaying 5 items.
- The NP-completeness of a tomographical problem on bicolored domino tilings (Q596077) (← links)
- On tiling under tomographic constraints. (Q1401222) (← links)
- Path puzzles: discrete tomography with a path constraint is hard (Q2308497) (← links)
- Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard: A solution to the 2-atom problem in discrete tomography (Q2902905) (← links)
- About the Complexity of Timetables and 3-Dimensional Discrete Tomography: A Short Proof of NP-Hardness (Q3651622) (← links)