Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. Discrete Probability and Algorithms;Aldous,1995
2. D. Applegate, R. Kannan, Sampling and integration of near log-concave functions, Proc. 23rd ACM Symp. Theory Comp., 1991, pp. 156–163.
3. T.E. Davis, J.C. Principe, A simulated annealing like convergence theory for the simple genetic algorithm, Proc. 4th Int. Conf. Genet. Algorithms, Morgan Kaufmann, 1991, pp. 174–181.
4. Geometric bounds for eigenvalues of Markov chains;Diaconis;Ann. Appl. Probab.,1991
5. P. Diaconis, S. Holmes, Three examples of Monte-Carlo Markov chains: at the interface between statistical computing, computer science, and statistical mechanics, Discrete Probability and Algorithms, Springer, New York, 1995, pp. 43–56.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献