A complexity trichotomy for approximately counting list H-colourings

類似資料

• A complexity trichotomy for approximately counting list H-colourings
  著者:: Galanis, A, 等
  出版事項: (2017)
• Approximately counting H-colourings is #BIS-hard
  著者:: Galanis, A, 等
  出版事項: (2016)
• Approximately counting H-colourings is BIS-Hard
  著者:: Galanis, A, 等
  出版事項: (2015)
• An approximation trichotomy for Boolean #CSP
  著者:: Dyer, M, 等
  出版事項: (2010)
• The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
  著者:: Goldberg, L, 等
  出版事項: (2016)