Author:
Zhang Jinshan,Bai Fengshan
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. I. Bezáková, D. Stefankovic, V.V. Vazirani, E. Vigoda, Accelerating simulated annealing for the permanent and combinatorial counting problems, in: SODA 06: Proc. 17th ACM–SIAM Sympos. on Discrete Algorithms, 2006, pp. 900–907.
2. Graph Theory with Applications;Bondy,1976
3. Some properties of nonnegative matrices and their permanents;Bregman;Soviet Math. Dokl.,1973
4. Polymers in Solution: Their Modelling and Structure;des Cloizeaux,1987
5. Hamilton cycles in random regular digraphs;Cooper;Combinatorics, Probability, and Computing,1994
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献