Goldberg, L., & Galanis, A. (2016). The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. Elsevier.
Čikaški stil citiranja (17. izdanje)Goldberg, L., i A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.
MLA način citiranja (9. izdanje)Goldberg, L., i A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.
Upozorenje: Ovi citati možda nisu uvijek 100% točni.