Approximate counting by dynamic programming
暂无分享,去创建一个
[1] Mark Jerrum,et al. A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph , 1995, Random Struct. Algorithms.
[2] Ben Morris. Improved bounds for sampling contingency tables , 2002, Random Struct. Algorithms.
[3] Martin E. Dyer,et al. Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[4] Mark Jerrum,et al. Mathematical Foundations of the Markov Chain Monte Carlo Method , 1998 .
[5] Alistair Sinclair,et al. Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions , 2004, SIAM J. Comput..
[6] P. Diaconis,et al. Testing for independence in a two-way table , 1985 .
[7] Alistair Sinclair,et al. Random walks on truncated cubes and sampling 0-1 knapsack solutions , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).
[8] Jesús A. De Loera,et al. Algebraic unimodular counting , 2001, Math. Program..
[9] Alistair Sinclair,et al. Random walks in convex sets , 2000 .
[10] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[11] J. Mount,et al. Application of Convex Sampling to Optimization and Contingency Table Generation/Counting. , 1995 .
[12] Mark Jerrum,et al. Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, WG.
[13] Randomly Coloring Constant Degree Graphs , 2004, FOCS.
[14] P. Diaconis,et al. Rectangular Arrays with Fixed Margins , 1995 .
[15] Martin E. Dyer,et al. Polynomial-time counting and sampling of two-rowed contingency tables , 2000, Theor. Comput. Sci..
[16] Martin E. Dyer,et al. A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant , 2002, STOC '02.
[17] Diane Hernek. Random generation of 2 × n contingency tables , 1998 .
[18] Martin E. Dyer,et al. A Mildly Exponential Time Algorithm for Approximating the Number of Solutions to a Multidimensional Knapsack Problem , 1993, Combinatorics, Probability and Computing.
[19] Diane Hernek. Random generation of 2×n contingency tables , 1998, Random Struct. Algorithms.
[20] Shing-Tung Yau,et al. On sampling with Markov chains , 1996, Random Struct. Algorithms.
[21] M. Jerrum. Counting, Sampling and Integrating: Algorithms and Complexity , 2003 .
[22] Martin E. Dyer,et al. Sampling contingency tables , 1997, Random Struct. Algorithms.