窗口约束下由行列和重构二元矩阵
Reconstructing binary matrices under window constraints from their row and column sums
摘要：
本文讨论了在给定子式元素个数和模式的附加约束下，由二元矩阵的行和与列和重构二元矩阵的离散反问题。虽然经典的一致性和重建问题的两个方向的离散层析成像可以在多项式时间内解决，事实证明，这些窗口的限制，导致各种意想不到的复杂性来回跳跃，从多项式时间的可解性$\mathbb{N}\mathbb{P}$ -硬度。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
