On the relative complexity of approximate counting problems

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]

Abstract

Abstract is missing.