The NP-completeness of a tomographical problem on bicolored domino tilings
type: Item
instance of: scholarly article
title: The NP-completeness of a tomographical problem on bicolored domino tilings
zbMATH Open document ID: 1068.05013
published in: Theoretical Computer Science
publication date: 2004-08-10T00:00:00Z
Mathematics Subject Classification ID: 05B45
Mathematics Subject Classification ID: 52B55
Mathematics Subject Classification ID: 52C22
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 92C55
zbMATH DE Number: 2085501
zbMATH Keywords: Domino tilings
zbMATH Keywords: Discrete tomography
zbMATH Keywords: Reconstruction algorithm
zbMATH Keywords: Computational complexity
author: Andrea Frosini
author: Giulia Simi
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.02.004
OpenAlex ID: W2048223006
cites work: Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
cites work: Q4198056
cites work: The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
cites work: Reconstruction of domino tiling from its two orthogonal projections
cites work: Dimer problem in statistical mechanics-an exact result
DOI: 10.1016/J.TCS.2004.02.004
description: scientific article; zbMATH DE number 2085501