Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Complexity of Approximating Bounded-Degree Boolean #CSP."

Martin E. Dyer et al. (2010)

> Home

Details and statistics

DOI: 10.4230/LIPICS.STACS.2010.2466

access: open

type: Conference or Workshop Paper

metadata version: 2022-10-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/stacs/DyerGJR10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stacs/DyerGJR10
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby:
The Complexity of Approximating Bounded-Degree Boolean #CSP. STACS 2010: 323-334

a service of

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.