Reconstructing a matrix with a given list of coefficients and prescribed row and column sums is NP-hard

Authors:
Yan Gerard
Affiliations:
LAIC, Auvergne University, Ensemble universitaire des Cézeaux, Aubière, France
Venue:
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Year:
2008

Citing 4
Cited 1

Three-Dimensional Statistical Data Security Problems

SIAM Journal on Computing
On the comptational complexity of determining polyatomic structures by X-rays

Theoretical Computer Science
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

Theoretical Computer Science
On the Reconstruction of Finite Lattice Sets from their X-Rays

DGCI '97 Proceedings of the 7th International Workshop on Discrete Geometry for Computer Imagery

Some theoretical challenges in digital geometry: A perspective

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate a natural generalization of the problem of reconstruction of a binary matrix A with prescribed row and column sums: we consider an integer matrix whose list of coefficients is given in the input. The question is to organize the coefficients in the matrix in order to obtain prescribed row and column sums. We prove that this problem is NP-complete by reducing it to a 2D problem of Discrete Tomography with 3 directions of projections.