APA (7th ed.) Citation

Komarath, B., Pandey, A., & Rahul, C. S. (2023). Monotone Arithmetic Complexity of Graph Homomorphism Polynomials. Algorithmica, 85(9), 2554-2579. https://doi.org/10.1007/s00453-023-01108-0

Chicago Style (17th ed.) Citation

Komarath, Balagopal, Anurag Pandey, and C. S. Rahul. "Monotone Arithmetic Complexity of Graph Homomorphism Polynomials." Algorithmica 85, no. 9 (2023): 2554-2579. https://doi.org/10.1007/s00453-023-01108-0.

MLA (9th ed.) Citation

Komarath, Balagopal, et al. "Monotone Arithmetic Complexity of Graph Homomorphism Polynomials." Algorithmica, vol. 85, no. 9, 2023, pp. 2554-2579, https://doi.org/10.1007/s00453-023-01108-0.