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)

Full work available at URL https://doi.org/10.1137/S0097539790191010

zbMATH Keywords

data securityLatin square constructionNP-complete

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Data encryption (aspects in computer science) (68P25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

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

(32)

• Graphs of transportation polytopes
• On the computational complexity of reconstructing lattice sets from their X-rays
• The discrete Radon transform and its approximate inversion via linear programming
• On properties of multi-dimensional statistical tables
• On the computational complexity of determining polyatomic structures by X-rays
• Reconstructing permutation matrices from diagonal sums
• On the algorithmic inversion of the discrete Radon transform
• Further steps on the reconstruction of convex polyominoes from orthogonal projections
• Computational complexity of three-dimensional discrete tomography with missing data
• Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\)
• Regular switching components
• Discrete tomography for inscribable lattice sets
• Markov bases of three-way tables are arbitrarily complicated
• Polyhedral combinatorics of multi-index axial transportation problems
• Solving the two color problem: an heuristic algorithm
• Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test
• The fewest clues problem of Picross 3D
• Reconstructing convex matrices by integer programming approaches
• On double-resolution imaging and discrete tomography
• The Complexity of Three-Way Statistical Tables
• scientific article; zbMATH DE number 2087727 (Why is no real title available?)
• Binary image reconstruction from a small number of projections and the morphological skeleton
• 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
• Minimal and minimal invariant Markov bases of decomposable models for contingency tables
• Perfect sampling on contingency tables with an application to SAGE data
• Collision-resistant hash function based on composition of functions
• Random generation of 2 2 2 J contingency tables
• A generalization of the integer linear infeasibility problem
• \(N\)-fold integer programming
• On the reconstruction of binary and permutation matrices under (binary) tomographic constraints

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)