Approximately counting integral flows and cell-bounded contingency tables
Authors:
Open Access
- 22 May 2005
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 413-422
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A polynomial-time algorithm to approximately count contingency tables when the number of rows is constantJournal of Computer and System Sciences, 2003
- Improved bounds for sampling contingency tablesRandom Structures & Algorithms, 2002
- Polynomial-time counting and sampling of two-rowed contingency tablesTheoretical Computer Science, 2000
- Fast Unimodular CountingCombinatorics, Probability and Computing, 2000
- Algebraic algorithms for sampling from conditional distributionsThe Annals of Statistics, 1998
- On uniform generation of two-way tables with fixed margins and the conditional volume test of Diaconis and EfronThe Annals of Statistics, 1996
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986
- Testing for Independence in a Two-Way Table: New Interpretations of the Chi-Square StatisticThe Annals of Statistics, 1985
- The complexity of computing the permanentTheoretical Computer Science, 1979