An approximation trichotomy for Boolean #CSP

Podobne zapisy

• The Complexity of Weighted Boolean CSP
  od: Dyer, M, i wsp.
  Wydane: (2009)
• A complexity trichotomy for approximately counting list H-colourings
  od: Galanis, A, i wsp.
  Wydane: (2017)
• A complexity trichotomy for approximately counting list H-colourings
  od: Goldberg, L, i wsp.
  Wydane: (2016)
• The complexity of counting locally maximal satisfying assignments of Boolean CSPs
  od: Goldberg, L, i wsp.
  Wydane: (2016)
• Fine-grained dichotomies for the Tutte Plane and Boolean #CSP
  od: Brand, C, i wsp.
  Wydane: (2018)