Goldberg, L., & Galanis, A. (2016). The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. Elsevier.
Style de citation Chicago (17e éd.)Goldberg, L., et A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.
Style de citation MLA (9e éd.)Goldberg, L., et A. Galanis. The Complexity of Approximately Counting in 2-spin Systems on K-uniform Bounded-degree Hypergraphs. Elsevier, 2016.
Attention : ces citations peuvent ne pas être correctes à 100%.