%0 Conference Paper %1 conf/approx/DyerGGJ00 %A Dyer, Martin E. %A Goldberg, Leslie Ann %A Greenhill, Catherine S. %A Jerrum, Mark %B APPROX %D 2000 %E Jansen, Klaus %E Khuller, Samir %I Springer %K dblp %P 108-119 %T On the relative complexity of approximate counting problems. %U http://dblp.uni-trier.de/db/conf/approx/approx2000.html#DyerGGJ00 %V 1913 %@ 3-540-67996-0

@inproceedings{conf/approx/DyerGGJ00, added-at = {2022-01-03T00:00:00.000+0100}, author = {Dyer, Martin E. and Goldberg, Leslie Ann and Greenhill, Catherine S. and Jerrum, Mark}, biburl = {https://www.bibsonomy.org/bibtex/2284ef37459733393bcf5945646331550/dblp}, booktitle = {APPROX}, crossref = {conf/approx/2000}, editor = {Jansen, Klaus and Khuller, Samir}, ee = {https://doi.org/10.1007/3-540-44436-X_12}, interhash = {d5edd067351d0eab8b5e2929fbd44479}, intrahash = {284ef37459733393bcf5945646331550}, isbn = {3-540-67996-0}, keywords = {dblp}, pages = {108-119}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T00:34:33.000+0200}, title = {On the relative complexity of approximate counting problems.}, url = {http://dblp.uni-trier.de/db/conf/approx/approx2000.html#DyerGGJ00}, volume = 1913, year = 2000 }