arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0405038math.OCmath.ACmath.STstat.TH

Small contingency tables with large gaps

Seth Sullivant

英文摘要:

We 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑