Goldberg, L., & Galanis, A. (2016). The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. Elsevier.
Lua i Stíl Chicago (17ú heag.)Goldberg, L., agus A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.
Lua MLA (9ú heag.)Goldberg, L., agus A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.
Rabhadh: Seans nach mbeach na luanna seo go hiomlán cruinn i ngach uile chás.