Three-dimensional Statistical Data Security Problems
DOI10.1137/S0097539790191010zbMATH Open0802.68046WikidataQ113434311 ScholiaQ113434311MaRDI QIDQ4286235FDOQ4286235
Authors: Robert W. Irving, Mark Jerrum 
Publication date: 27 March 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Recommendations
- A Graph Theoretic Approach to Statistical Data Security
- The Complexity of Three-Way Statistical Tables
- Statistical disclosure in general three‐dimensional tables
- scientific article; zbMATH DE number 2087727
- A three-phase algorithm for the cell suppression problem in two-dimensional statistical tables
Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Orthogonal arrays, Latin squares, Room squares (05B15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (31)
- On properties of multi-dimensional statistical tables
- X-rays characterizing some classes of discrete sets
- The fewest clues problem of Picross 3D
- Computational complexity of three-dimensional discrete tomography with missing data
- On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
- \(N\)-fold integer programming
- On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- On double-resolution imaging and discrete tomography
- The discrete Radon transform and its approximate inversion via linear programming
- The Complexity of Three-Way Statistical Tables
- Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test
- On the algorithmic inversion of the discrete Radon transform
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
- Minimal and minimal invariant Markov bases of decomposable models for contingency tables
- Reconstructing permutation matrices from diagonal sums
- Title not available (Why is that?)
- Graphs of transportation polytopes
- Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\)
- Markov bases of three-way tables are arbitrarily complicated
- Polyhedral combinatorics of multi-index axial transportation problems
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays
- Discrete tomography for inscribable lattice sets
- Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables
- A generalization of the integer linear infeasibility problem
- On the computational complexity of determining polyatomic structures by X-rays
- Regular switching components
- Binary image reconstruction from a small number of projections and the morphological skeleton
- Perfect sampling on contingency tables with an application to SAGE data
- Reconstructing convex matrices by integer programming approaches
- Solving the two color problem: an heuristic algorithm
This page was built for publication: Three-dimensional Statistical Data Security Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286235)
