{"id":"openai-math/An-FPRAS-for-Cell-Bounded-Contingency-Tables","pdf":"https://github.com/openai/math/blob/main/preprints/An-FPRAS-for-Cell-Bounded-Contingency-Tables-September-24-2026/main.pdf","url":"https://github.com/openai/math/tree/main/preprints/An-FPRAS-for-Cell-Bounded-Contingency-Tables-September-24-2026","tags":["combinatorics","approximate-counting"],"score":0,"title":"An FPRAS for Cell-Bounded Contingency Tables","domain":"Theoretical computer science","family":"115","origin":"ai-generated","source":"openai-math","authors":["OpenAI"],"reviews":0,"subject":"cs.CC","summary":"We give a fully polynomial randomized approximation scheme for counting nonnegative integer matrices with prescribed row sums, column sums, and individual entry bounds. Both dimensions vary, all numerical data are encoded in binary, and zero bounds are allowed. The algorithm uses only unbiased random bits and has a polynomial bound on its bit operations on every execution.","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"discussed":1,"published":"2026-09-24","reactions":{},"discussion":[{"url":"https://x.com/ksmeel/status/2111104784002437244","date":"2026-10-16","kind":"x","added":"2026-10-24","author":"Kuldeep S. Meel","handle":"ksmeel"}],"formalized":false,"family_title":"Sampling and counting contingency tables with arbitrary margins"}