A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant
We consider the problem of counting the number of contingency tables with given row and column sums. This problem is known to be #P-complete, even when there are only two rows [7]. In this paper we present the first fully-polynomial randomized approximation scheme for counting contingency tables when the number …