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

類似資料