An approximation trichotomy for Boolean #CSP
Huvudupphovsmän: | Dyer, M, Goldberg, L, Jerrum, M |
---|---|
Materialtyp: | Journal article |
Publicerad: |
2010
|
Liknande verk
-
The Complexity of Weighted Boolean CSP
av: Dyer, M, et al.
Publicerad: (2009) -
A complexity trichotomy for approximately counting list H-colourings
av: Galanis, A, et al.
Publicerad: (2017) -
A complexity trichotomy for approximately counting list H-colourings
av: Goldberg, L, et al.
Publicerad: (2016) -
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
av: Goldberg, L, et al.
Publicerad: (2016) -
Fine-grained dichotomies for the Tutte Plane and Boolean #CSP
av: Brand, C, et al.
Publicerad: (2018)