Tile-Packing Tomography Is $\mathbb{NP}$ -hard
Open Access
- 19 February 2011
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 64 (2) , 267-278
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hardLecture Notes in Computer Science, 2009
- Reconstruction of Binary Matrices under Adjacency Constraints2008
- Advances in Discrete Tomography and Its Applications2007
- The reconstruction of a subclass of domino tilings from two projectionsDiscrete Applied Mathematics, 2005
- Tiling with bars under tomographic constraintsTheoretical Computer Science, 2003
- On tiling under tomographic constraintsTheoretical Computer Science, 2003
- Reconstruction of domino tiling from its two orthogonal projectionsTheoretical Computer Science, 2001
- On the computational complexity of determining polyatomic structures by X-raysTheoretical Computer Science, 2000
- Combinatorial Mathematics1963
- Matrices of zeros and onesBulletin of the American Mathematical Society, 1960