"The Relative Complexity of Approximate Counting Problems."

Martin E. Dyer et al. (2004)

> Home

Details and statistics

DOI: 10.1007/S00453-003-1073-Y

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DyerGGJ03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DyerGGJ03
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
The Relative Complexity of Approximate Counting Problems. Algorithmica 38(3): 471-500 (2004)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.