An approximation trichotomy for Boolean #CSP
Glavni autori: | Dyer, M, Goldberg, L, Jerrum, M |
---|---|
Format: | Journal article |
Izdano: |
2010
|
Slični predmeti
-
The Complexity of Weighted Boolean CSP
od: Dyer, M, i dr.
Izdano: (2009) -
A complexity trichotomy for approximately counting list H-colourings
od: Galanis, A, i dr.
Izdano: (2017) -
A complexity trichotomy for approximately counting list H-colourings
od: Goldberg, L, i dr.
Izdano: (2016) -
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
od: Goldberg, L, i dr.
Izdano: (2016) -
Fine-grained dichotomies for the Tutte Plane and Boolean #CSP
od: Brand, C, i dr.
Izdano: (2018)