Funder
United States-Israel Binational Science Foundation
Israel Science Foundation
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. M. Bayati, D. Gamarnik, D. Katz, C. Nair, P. Tetali, Simple deterministic approximation algorithms for counting matchings, in: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 2007, pp. 122–127.
2. A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant;Cryan;J. Comput. System Sci.,2003
3. Rapidly mixing markov chains for sampling contingency tables with a constant number of rows;Cryan;SIAM J. Comput.,2006
4. Testing for independence in a two-way table: new interpretations of the chi-square statistic;Diaconis;Ann. Statist.,1985
5. M. Dyer, Approximate counting by dynamic programming, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 2003, pp. 693–699.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献