APA引文

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

Chicago Style (17th ed.) Citation

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

MLA引文

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

警告：這些引文格式不一定是100％准確.