@article{Dyer/03,
	title = {The Relative Complexity of Approximate Counting Problems},
	author = {Martin Dyer and Leslie Ann Goldberg and Catherine Greenhill and Mark Jerrum},
	journal = {Algorithmica},
	month = {12},
	number = {3},
	pages = {471--500},
	url = {http://dx.doi.org/10.1007/s00453-003-1073-y},
	volume = {38},
	year = {2003},
	biburl = {http://www.bibsonomy.org/bibtex/2c3e94d1f515ed292bdc74d16047c643b/mboley},
	description = {SpringerLink - Zeitschriftenbeitrag},
	abstract = {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.},
	keywords = {approximation complexity counting }
}