Three-dimensional Statistical Data Security Problems
From MaRDI portal
Publication:4286235
DOI10.1137/S0097539790191010zbMath0802.68046WikidataQ113434311 ScholiaQ113434311MaRDI QIDQ4286235
Robert W. Irving, Mark R. Jerrum
Publication date: 27 March 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Data encryption (aspects in computer science) (68P25) Orthogonal arrays, Latin squares, Room squares (05B15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (27)
The discrete Radon transform and its approximate inversion via linear programming ⋮ On Double-Resolution Imaging and Discrete Tomography ⋮ Minimal and minimal invariant Markov bases of decomposable models for contingency tables ⋮ The Fewest Clues Problem of Picross 3D ⋮ Reconstructing convex matrices by integer programming approaches ⋮ Regular switching components ⋮ Discrete tomography for inscribable lattice sets ⋮ A generalization of the integer linear infeasibility problem ⋮ Markov bases of three-way tables are arbitrarily complicated ⋮ Perfect sampling on contingency tables with an application to SAGE data ⋮ Computational complexity of three-dimensional discrete tomography with missing data ⋮ Solving the Two Color Problem: An Heuristic Algorithm ⋮ Binary image reconstruction from a small number of projections and the morphological skeleton ⋮ \(N\)-fold integer programming ⋮ On the reconstruction of binary and permutation matrices under (binary) tomographic constraints ⋮ Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\) ⋮ Polyhedral combinatorics of multi-index axial transportation problems ⋮ Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables ⋮ Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms ⋮ X-rays characterizing some classes of discrete sets ⋮ On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays ⋮ On the computational complexity of determining polyatomic structures by X-rays ⋮ Graphs of transportation polytopes ⋮ Further steps on the reconstruction of convex polyominoes from orthogonal projections ⋮ On the computational complexity of reconstructing lattice sets from their \(X\)-rays ⋮ Reconstructing permutation matrices from diagonal sums ⋮ On the algorithmic inversion of the discrete Radon transform
This page was built for publication: Three-dimensional Statistical Data Security Problems
