For any nonnegative row and column margins with equal totals, an exact uniform sampler for integer contingency tables terminates almost surely and has expected bit complexity polynomial in both dimensions and the binary input length.
For any nonnegative row and column margins with equal totals, an exact uniform sampler for integer contingency tables terminates almost surely and has expected bit complexity polynomial in both dimensions and the binary input length.
For any nonnegative row and column margins with equal totals, an exact uniform sampler for integer contingency tables terminates almost surely and has expected bit complexity polynomial in both dimensions and the binary input length.
If correct, gives exact uniform sampling with no structural restriction on the margins or dimensions.
Can contingency tables with arbitrary prescribed margins be sampled exactly uniformly in expected polynomial bit time?
Publication dates and editorial changes.
OpenAI reports exact uniform sampling of contingency tables with arbitrary margins
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
