Reconstructing Binary Matrices underWindow Constraints from their Row and Column Sums

Alpers, Andreas ORCID: 0000-0003-0663-6037 and Gritzmann, Peter (2017) Reconstructing Binary Matrices underWindow Constraints from their Row and Column Sums. FUNDAMENTA INFORMATICAE, 155 (4). pp. 321-340.

Text
1702.06121v1.pdf - Author Accepted Manuscript
Download (635kB) | Preview

Official URL: http://dx.doi.org/10.3233/fi-2017-1588

Abstract

The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical consistency and reconstruction problems for two directions in discrete tomography can be solved in polynomial time, it turns out that these window constraints cause various unexpected complexity jumps back and forth from polynomial-time solvability to $\mathbb{N}\mathbb{P}$-hardness.

Item Type:	Article
Uncontrolled Keywords:	Tomography, analytical reconstruction algorithms, consistency conditions
Depositing User:	Symplectic Admin
Date Deposited:	05 May 2020 10:24
Last Modified:	18 Jan 2023 23:53
DOI:	10.3233/FI-2017-1588
Related URLs:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3085597