Goldberg, L., & Galanis, A. (2016). The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. Elsevier.
Чикаго-гийн эшлэл (17 дахь хэвлэлт)Goldberg, L., ба A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.
MLA -ийн эшлэл (9 дэх хэвлэлт)Goldberg, L., ба A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.
Анхааруулга: Эдгээр ишлэлүүд үргэлж 100% үнэн зөв биш байж магадгүй.