An approximation trichotomy for Boolean #CSP
Prif Awduron: | Dyer, M, Goldberg, L, Jerrum, M |
---|---|
Fformat: | Journal article |
Cyhoeddwyd: |
2010
|
Eitemau Tebyg
-
The Complexity of Weighted Boolean CSP
gan: Dyer, M, et al.
Cyhoeddwyd: (2009) -
A complexity trichotomy for approximately counting list H-colourings
gan: Galanis, A, et al.
Cyhoeddwyd: (2017) -
A complexity trichotomy for approximately counting list H-colourings
gan: Goldberg, L, et al.
Cyhoeddwyd: (2016) -
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
gan: Goldberg, L, et al.
Cyhoeddwyd: (2016) -
Fine-grained dichotomies for the Tutte Plane and Boolean #CSP
gan: Brand, C, et al.
Cyhoeddwyd: (2018)