# Reconstructing binary matrices under window constraints from their row and column sums

arXiv: https://arxiv.org/abs/1702.06121 · HTML: https://mlsanity.com/paper/1702.06121/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Feb 2017.

## Built on by (most cited first, 1 of 1)

- [Efficient Generation of Binary Magic Squares](https://mlsanity.com/paper/2511.00547/) (2025)

## Abstract (arXiv)

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 mathbbNmathbbP-hardness.