APA (7th ed.) Citation

Yang, P., Huang, Y., & Fu, Z. (2024). The computational complexity of Holant problems on 3-regular graphs. Theoretical computer science, 982, 114256. https://doi.org/10.1016/j.tcs.2023.114256

Chicago Style (17th ed.) Citation

Yang, Peng, Yuan Huang, and Zhiguo Fu. "The Computational Complexity of Holant Problems on 3-regular Graphs." Theoretical Computer Science 982 (2024): 114256. https://doi.org/10.1016/j.tcs.2023.114256.

MLA (9th ed.) Citation

Yang, Peng, et al. "The Computational Complexity of Holant Problems on 3-regular Graphs." Theoretical Computer Science, vol. 982, 2024, p. 114256, https://doi.org/10.1016/j.tcs.2023.114256.