The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs

Eitemau Tebyg

• The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
  gan: Goldberg, L, et al.
  Cyhoeddwyd: (2016)
• The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
  gan: Galanis, A, et al.
  Cyhoeddwyd: (2015)
• Approximating partition functions of bounded- degree Boolean counting Constraint Satisfaction Problems
  gan: Galanis, A, et al.
  Cyhoeddwyd: (2017)
• Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
  gan: Galanis, A, et al.
  Cyhoeddwyd: (2020)
• The complexity of approximating the complex-valued Ising model on bounded degree graphs
  gan: Galanis, A, et al.
  Cyhoeddwyd: (2022)