Three-dimensional Statistical Data Security Problems

DOI10.1137/S0097539790191010MaRDI QIDQ4286235zbMATH OpenWikidataFDO

Authors Robert W. Irving, Mark Jerrum

Publication date 27 March 1994

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

NP-completedata securityLatin square construction

Mathematics Subject Classification ID

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)

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

Cited in

(31)

• Solving the two color problem: an heuristic algorithm
• 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
• \(N\)-fold integer programming
• On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
• On the computational complexity of reconstructing three-dimensional lattice sets from their two-dimensional \(X\)-rays
• Further steps on the reconstruction of convex polyominoes from orthogonal projections
• The discrete Radon transform and its approximate inversion via linear programming
• On double-resolution imaging and discrete tomography
• The Complexity of Three-Way Statistical Tables
• On the algorithmic inversion of the discrete Radon transform
• Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test
• Minimal and minimal invariant Markov bases of decomposable models for contingency tables
• Reconstructing permutation matrices from diagonal sums
• Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
• Graphs of transportation polytopes
• scientific article; zbMATH DE number 2087727 (Why is no real title available?)
• Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\)
• Markov bases of three-way tables are arbitrarily complicated
• On the computational complexity of reconstructing lattice sets from their X-rays
• Polyhedral combinatorics of multi-index axial transportation problems
• Discrete tomography for inscribable lattice sets
• Random generation of 2 2 2 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

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)