An approximation trichotomy for Boolean #CSP
Principais autores: | Dyer, M, Goldberg, L, Jerrum, M |
---|---|
Formato: | Journal article |
Publicado em: |
2010
|
Registros relacionados
-
The Complexity of Weighted Boolean CSP
por: Dyer, M, et al.
Publicado em: (2009) -
A complexity trichotomy for approximately counting list H-colourings
por: Galanis, A, et al.
Publicado em: (2017) -
A complexity trichotomy for approximately counting list H-colourings
por: Goldberg, L, et al.
Publicado em: (2016) -
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
por: Goldberg, L, et al.
Publicado em: (2016) -
Fine-grained dichotomies for the Tutte Plane and Boolean #CSP
por: Brand, C, et al.
Publicado em: (2018)