Informatics Report Series



Related Pages

Report (by Number) Index
Report (by Date) Index
Author Index
Institute Index

Title:The Relative Complexity of Approximate Counting Problems
Authors: Martin Dyer ; Leslie Ann Goldberg ; Catherine Greenhill ; Mark Jerrum
Date:Dec 2003
Publication Title:Algorithmica
Publication Type:Journal Article Publication Status:Published
Volume No:38(3) Page Nos:471-500
Two natural classes of counting problems that are interreducible under approximation-preserving reductions are: (i) those that admit a particular kind of efficient approximation algorithm known as an ``FPRAS'', and (ii) those that are complete for #P with respect to approximation-preserving reducibility. We describe and investigate not only these two classes but also a third class, of intermediate complexity, that is not known to be identical to (i) or (ii). The third class can be characterised as the hardest problems in a logically defined subclass of #P.
Links To Paper
1st Link
Bibtex format
author = { Martin Dyer and Leslie Ann Goldberg and Catherine Greenhill and Mark Jerrum },
title = {The Relative Complexity of Approximate Counting Problems},
journal = {Algorithmica},
publisher = {Springer},
year = 2003,
month = {Dec},
volume = {38(3)},
pages = {471-500},
doi = {10.1007/s00453-003-1073-y},
url = {},

Home : Publications : Report 

Please mail <> with any changes or corrections.
Unless explicitly stated otherwise, all material is copyright The University of Edinburgh