The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This classification is based on a beautiful connection to the so-call...
主要な著者: | Goldberg, L, Galanis, A |
---|---|
フォーマット: | Journal article |
出版事項: |
Elsevier
2016
|
類似資料
-
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
著者:: Goldberg, L, 等
出版事項: (2016) -
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs
著者:: Galanis, A, 等
出版事項: (2015) -
Approximating partition functions of bounded- degree Boolean counting Constraint Satisfaction Problems
著者:: Galanis, A, 等
出版事項: (2017) -
Approximating partition functions of bounded-degree Boolean counting Constraint Satisfaction Problems
著者:: Galanis, A, 等
出版事項: (2020) -
The complexity of approximating the complex-valued Ising model on bounded degree graphs
著者:: Galanis, A, 等
出版事項: (2022)