A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 240-249

  Cryan, Mary ^a   Dyer, Martin ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; MATRIX ALGEBRA; NUMERICAL METHODS; RANDOM PROCESSES; VECTORS;

CONTINGENCY TABLES; FULLY POLYNOMIAL RANDOMIZED APPROXIMATION SCHEME; POLYNOMIAL-TIME ALGORITHM;

ALGORITHMS;

EID: 0036038401     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509943.509946     Document Type: Conference Paper

References (14)

1. On sampling with Markov chains
2. Testing for independence in a two-way table: New interpretations of the chi-square statistic (with discussion)
3. Rectangular arrays with fixed margins
4. Random walk on contingency tables with fixed row and column sums
5. A random polynomial-time algorithm for approximating the volume of convex bodies
6. Polynomial-time counting and sampling of two-rowed contingency tables
7. Sampling contingency tables
8. Random generation of 2 × n contingency tables
9. 5) volume algorithm for convex bodies
10. Markov chain Monte Carlo method: An approach to approximate counting and integration
11. Monte-Carlo algorithms for enumeration and reliability problems
12. Improved bounds for sampling contingency tables