An approximation trichotomy for Boolean #CSP
Main Authors: | Dyer, M, Goldberg, L, Jerrum, M |
---|---|
Format: | Journal article |
Published: |
2010
|
Similar Items
-
The Complexity of Weighted Boolean CSP
by: Dyer, M, et al.
Published: (2009) -
A complexity trichotomy for approximately counting list H-colourings
by: Galanis, A, et al.
Published: (2017) -
A complexity trichotomy for approximately counting list H-colourings
by: Goldberg, L, et al.
Published: (2016) -
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
by: Goldberg, L, et al.
Published: (2016) -
Fine-grained dichotomies for the Tutte Plane and Boolean #CSP
by: Brand, C, et al.
Published: (2018)