%0 Journal Article %1 journals/algorithmica/DyerGGJ03 %A Dyer, Martin E. %A Goldberg, Leslie Ann %A Greenhill, Catherine S. %A Jerrum, Mark %D 2004 %J Algorithmica %K dblp %N 3 %P 471-500 %T The Relative Complexity of Approximate Counting Problems. %U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica38.html#DyerGGJ03 %V 38

@article{journals/algorithmica/DyerGGJ03, added-at = {2017-06-13T00:00:00.000+0200}, author = {Dyer, Martin E. and Goldberg, Leslie Ann and Greenhill, Catherine S. and Jerrum, Mark}, biburl = {https://www.bibsonomy.org/bibtex/2158214cc41503056e4ded2e5e63c081b/dblp}, ee = {https://doi.org/10.1007/s00453-003-1073-y}, interhash = {a0d609804f10204fcb3cac646e6165c9}, intrahash = {158214cc41503056e4ded2e5e63c081b}, journal = {Algorithmica}, keywords = {dblp}, number = 3, pages = {471-500}, timestamp = {2017-06-14T11:38:16.000+0200}, title = {The Relative Complexity of Approximate Counting Problems.}, url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica38.html#DyerGGJ03}, volume = 38, year = 2004 }