The Relative Complexity of Approximate Counting Problems

Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum. The Relative Complexity of Approximate Counting Problems. Algorithmica, 38(3):471-500, 2003. [doi]

Authors

Martin E. Dyer

This author has not been identified. Look up 'Martin E. Dyer' in Google

Leslie Ann Goldberg

This author has not been identified. Look up 'Leslie Ann Goldberg' in Google

Catherine S. Greenhill

This author has not been identified. Look up 'Catherine S. Greenhill' in Google

Mark Jerrum

This author has not been identified. Look up 'Mark Jerrum' in Google