"On the relative complexity of approximate counting problems."

Martin E. Dyer et al. (2000)

> Home

Details and statistics

DOI: 10.1007/3-540-44436-X_12

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/approx/DyerGGJ00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/DyerGGJ00
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Mark Jerrum:
On the relative complexity of approximate counting problems. APPROX 2000: 108-119

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.