Cita APA (7a ed.)

Goldberg, L., & Galanis, A. (2016). The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. Elsevier.

Cita Chicago Style (17a ed.)

Goldberg, L., y A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.

Cita MLA (9a ed.)

Goldberg, L., y A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.