%0 Journal Article %1 journals/tcs/ZhangB11 %A Zhang, Jinshan %A Bai, Fengshan %D 2011 %J Theor. Comput. Sci. %K dblp %N 4-5 %P 419-429 %T An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs. %U http://dblp.uni-trier.de/db/journals/tcs/tcs412.html#ZhangB11 %V 412

@article{journals/tcs/ZhangB11, added-at = {2021-02-17T00:00:00.000+0100}, author = {Zhang, Jinshan and Bai, Fengshan}, biburl = {https://www.bibsonomy.org/bibtex/2620363c96fe3b32d0ef0e3ad8a1f34e9/dblp}, ee = {https://doi.org/10.1016/j.tcs.2010.10.014}, interhash = {5188c2d8f9e7538e9096d1d3689f0f5f}, intrahash = {620363c96fe3b32d0ef0e3ad8a1f34e9}, journal = {Theor. Comput. Sci.}, keywords = {dblp}, number = {4-5}, pages = {419-429}, timestamp = {2024-04-08T18:36:43.000+0200}, title = {An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs.}, url = {http://dblp.uni-trier.de/db/journals/tcs/tcs412.html#ZhangB11}, volume = 412, year = 2011 }