"The complexity of approximating bounded-degree Boolean #CSP."

Martin E. Dyer et al. (2012)

> Home

Details and statistics

DOI: 10.1016/J.IC.2011.12.007

access: open

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/DyerGJR12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/DyerGJR12
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The complexity of approximating bounded-degree Boolean #CSP. Inf. Comput. 220: 1-14 (2012)

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.