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 polynomialtime solvability to NP-hardness.
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 321-340 |
| Seitenumfang | 20 |
| Fachzeitschrift | Fundamenta Informaticae |
| Jahrgang | 155 |
| Ausgabenummer | 4 |
| DOIs | |
| Publikationsstatus | Veröffentlicht - 2017 |