A complexity trichotomy for approximately counting list H-colourings

Míreanna comhchosúla

• A complexity trichotomy for approximately counting list H-colourings
  de réir: Galanis, A, et al.
  Foilsithe / Cruthaithe: (2017)
• Approximately counting H-colourings is #BIS-hard
  de réir: Galanis, A, et al.
  Foilsithe / Cruthaithe: (2016)
• Approximately counting H-colourings is BIS-Hard
  de réir: Galanis, A, et al.
  Foilsithe / Cruthaithe: (2015)
• An approximation trichotomy for Boolean #CSP
  de réir: Dyer, M, et al.
  Foilsithe / Cruthaithe: (2010)
• The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
  de réir: Goldberg, L, et al.
  Foilsithe / Cruthaithe: (2016)