The relative complexity of approximate counting problems
UNSPECIFIED (2004) The relative complexity of approximate counting problems. In: Workshop on Approximation Algorithms, GERMANY, 2000. Published in: ALGORITHMICA, 38 (3). pp. 471-500.Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/s00453-003-1073-y
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.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Q Science > QA Mathematics
|Journal or Publication Title:||ALGORITHMICA|
|Official Date:||March 2004|
|Number of Pages:||30|
|Page Range:||pp. 471-500|
|Title of Event:||Workshop on Approximation Algorithms|
|Location of Event:||GERMANY|
|Date(s) of Event:||2000|
Actions (login required)