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-Zitierstil (17. Ausg.)Yang, Peng, Yuan Huang, und 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-Zitierstil (9. Ausg.)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.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.