Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum. On the relative complexity of approximate counting problems. In Klaus Jansen, Samir Khuller, editors, Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings. Volume 1913 of Lecture Notes in Computer Science, pages 108-119, Springer, 2000. [doi]
@inproceedings{DyerGGJ00,
title = {On the relative complexity of approximate counting problems},
author = {Martin E. Dyer and Leslie Ann Goldberg and Catherine S. Greenhill and Mark Jerrum},
year = {2000},
url = {http://link.springer.de/link/service/series/0558/bibs/1913/19130108.htm},
researchr = {https://researchr.org/publication/DyerGGJ00},
cites = {0},
citedby = {0},
pages = {108-119},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings},
editor = {Klaus Jansen and Samir Khuller},
volume = {1913},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-67996-0},
}