Reconstructing permutation matrices from diagonal sums
From MaRDI portal
Publication:1603693
DOI10.1016/S0304-3975(02)00015-4zbMath0996.68223MaRDI QIDQ1603693
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
combinatorial problem; permutation; permutation matrix; discrete tomography; finite abelian group; diagonal sum
68U10: Computing methodologies for image processing
Related Items
Zero-sum problems in finite Abelian groups: a survey, A polynomial-time algorithm for finding zero-sums., In memoriam: Alberto Del Lungo (1965--2003), On the X-rays of permutations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
- Invariant sets of arcs in network flow problems
- Switching components and the ambiguity problem in the reconstruction of pictures from their projections
- On weighted sums in abelian groups
- Discrete tomography. Foundations, algorithms, and applications
- A combinatorial problem on finite abelian groups
- Zero-sum problems -- a survey
- Remarks on a zero-sum theorem
- Three-dimensional Statistical Data Security Problems
- A Combinatorial Problem on Abelian Groups