The Complexity of Three-Way Statistical Tables

DOI10.1137/S0097539702403803zbMath1101.68996arXivmath/0207200OpenAlexW2163145504MaRDI QIDQ4651494

Jesús A. De Loera, Shmuel Onn

Publication date: 21 February 2005

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

Full work available at URL: https://arxiv.org/abs/math/0207200

zbMATH Keywords

computational complexitytransportation problemsconfidentialitydata qualitycontingency tabledata securitytransportation polytopestatistical disclosure controlFréchet boundstatistical tablemarginal statistics

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Contingency tables (62H17)

Related Items

Huge Unimodular $n$-Fold Programs, Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory, Bounds on Kronecker coefficients via contingency tables, A polynomial oracle-time algorithm for convex integer minimization, \(N\)-fold integer programming and nonlinear multi-transshipment, On properties of multi-dimensional statistical tables, Lower bounds for contingency tables via Lorentzian polynomials, A formulation of the wide partition conjecture using the atom problem in discrete tomography, Nonlinear bipartite matching, Markov bases of three-way tables are arbitrarily complicated, Computational complexity of three-dimensional discrete tomography with missing data, \(N\)-fold integer programming, On the complexity of computing Kronecker coefficients, Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes, Convex integer maximization via Graver bases, Graphs of transportation polytopes, Permutohedra and minimal matrices, Gröbner bases and polyhedral geometry of reducible and cyclic models.