Goldberg, L., & Galanis, A. (2016). The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. Elsevier.
Citação norma ChicagoGoldberg, L., and A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.
Citação norma MLAGoldberg, L., and A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.
Nota: a formatação da citação pode não corresponder 100% ao definido pela respectiva norma.