Using a dynamic programming approach, we prove that a large variety of matrix reconstruction problems from two projections can be solved in polynomial time whenever the number of rows (or columns) is fixed. We also prove some complexity results for several problems concerning the reconstruction of a binary matrix when a neighborhood constraint occurs. © 2008 Elsevier B.V. All rights reserved.
Brocchi, S., Frosini, A., & Picouleau, C. (2008). Reconstruction of binary matrices under fixed size neighborhood constraints. Theoretical Computer Science, 406(1–2), 43–54. https://doi.org/10.1016/j.tcs.2008.07.024