Approximate counting by dynamic programming

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 693-694

  Dyer, Martin ^a  

^a UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; POLYNOMIALS; PROBABILITY;

ZERO-ONE KNAPSACK;

DYNAMIC PROGRAMMING;

EID: 0038446808     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780642.780643     Document Type: Conference Paper

References (19)

1. F. Chung, R. Graham and S. Yau. On sampling with Markov chains. Random Structures and Algorithms, 9, 1996, pp. 55-77.
2. M. Cryan and M. Dyer. A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. In Proceedings of the 34th Annual Symposium on Theory of Computing, 2002, pp. 240-249.
3. M. Cryan, M. Dyer, L. Goldberg, M. Jerrum and R. Martin. Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, 2002, pp. 711-720.
4. J. De Loera and B. Sturmfels. Algebraic unimodular counting. Preprint, University of California at Davis, 2001.
5. P. Diaconis and B. Efron. Testing for independence in a two-way table: new interpretations of the chi-square statistic (with discussion). Annals of Statistics, 13, 1995, pp. 845-913.
6. P. Diaconis and A. Gangolli, Rectangular arrays with fixed margins. In Discrete Probability and Algorithms (D. Aldous, P. Varaiya, J. Spencer and J. Steele, Eds.), IMA Volumes on Mathematics and its Applications, 72, Springer, New York, 1995, pp. 15-41.
7. P. Diaconis and L. Saloff-Coste. Random walk on contingency tables with fixed row and column sums. Technical Report, Department of Mathematics, Harvard University, 1995.
8. M. Dyer, A. Frieze, R. Kannan, A. Kapoor, L. Perkovic and U. Vazirani. A mildly exponential algorithm for estimating the number of knapsack solutions. Combinatorics, Probability and Computing, 2, 1993, pp. 271-284.
9. M. Dyer and C. Greenhill. Polynomial-time counting and sampling of two-rowed contingency tables. Theoretical Computer Science, 246, 2000, pp. 265-278.
10. M. Dyer, R. Kannan and J. Mount. Sampling contingency tables. Random Structures and Algorithms, 10, 1997, pp. 487-506.
11. D. Hernek. Random generation of 2 × n contingency tables. Random Structures and Algorithms, 13, 1998, pp. 71-79.
12. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58, 1963, pp. 13-30.
13. M. Jerrum, Counting, sampling and integrating: algorithms and complexity, Birkhäuser, Basel, 2003.
14. B. Morris, Improved bounds for sampling contingency tables. In 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, Lecture Notes in Computer Science 1671, 1999, pp. 121-129.
15. B. Morris, Random walks in convex sets. PhD thesis, Department of Statistics, University of California, Berkeley, 2000.
16. B. Morris and A. Sinclair, Random walks on truncated cubes and sampling 0-1 knapsack solutions. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, 1999, pp. 230-240.
17. B. Morris and A. Sinclair, Random walks on truncated cubes and sampling 0-1 knapsack solutions, July 2002, submitted. (An extended and improved version of [16].)
18. J. Mount, Application of convex sampling to optimization and contingency table generation. PhD thesis, Technical report CMU-CS-95-152, Computer Science Department, Carnegie Mellon University, 1995.
19. A. Sinclair and M. Jerrum, Approximate counting, uniform generation, and rapidly mixing Markov chains. Information and Computation, 82, 1989, pp. 93-133.