Small contingency tables with large gaps

Simple item page
dc.creatorSullivant, Seth
dc.date2004-05-03
dc.date.accessioned2026-07-07T08:06:15Z
dc.date.available2026-07-07T08:06:15Z
dc.descriptionWe construct examples of contingency tables on $n$ binary random variables where the gap between the linear programming lower/upper bound and the true integer lower/upper bounds on cell entries is exponentially large. These examples provide evidence that linear programming may not be an effective heuristic for detecting disclosures when releasing margins of multi-way tables.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/math/0405038
dc.identifierhttp://arxiv.org/abs/math/0405038
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130543
dc.subjectOptimization and Control
dc.subjectCommutative Algebra
dc.subjectStatistics Theory
dc.titleSmall contingency tables with large gaps
dc.typetext

Files

Collections

arXiv